Interview Experience - February 2025 Date: 6th February 2025 First Round: HackerRank Platform Received two problem statements to be solved within 60 minutes: Similar to FindEarliestMaxInteractions (Given startTime and endTime). Not sure (Couldn’t recall). Call Received: 19th February 2025 Interview Scheduled: 20th February 2025 (Pool Hiring Process) (Super-day) Interview Rounds 1) Behavioral Round Focused on team dynamics, learnings, and challenges faced in past projects. 2) Code-Pair Round A HackerRank link was shared, and the interviewer directly started with coding questions. Questions Asked: Code Review Task: Given a problem statement where a colleague had written code, I had to review and identify issues in it. Coding Problem: java Copy Edit public static int maxUnits(int[] boxes, int[] unitsPerBox, int trunkSize) { int n = boxes.length; BoxType[] boxTypes = new BoxType[n]; for (int i = 0; i < n; i++) { boxTypes[i] = new BoxType(boxes[i], unitsPerBox[i]); } Arrays.sort(boxTypes, (a, b) -> b.unitsPerBox - a.unitsPerBox); int totalUnits = 0; int boxesUsed = 0; for (BoxType boxType : boxTypes) { int boxesToUse = Math.min(boxType.numberOfBoxes, trunkSize - boxesUsed); totalUnits += boxesToUse * boxType.unitsPerBox; boxesUsed += boxesToUse; if (boxesUsed == trunkSize) { break; } } return totalUnits; } The question was similar to this problem. 3) System Design Round Design a Video Streaming Application Ensure that watch history is maintained efficiently.