JPMorgan SE3 Software Engineer Onsite Interview 2025

YOE 6 at FAANG ### R1: 1. Project details and then two coding questions. 2. The storage drive isn't being used efficiently because the data is scattered across many partitions. Each partition has some

YOE 6 at FAANG ### R1: 1. Project details and then two coding questions. 2. The storage drive isn't being used efficiently because the data is scattered across many partitions. Each partition has some space already used under maximum capacity. Rearrange the data so that it takes up the fewest possible partitions. Find the minimum number of partitions needed. For example,

input n equal to 5 partitions, used equal to 3, 2, 1, 3, 1. Total capacity equal to 3, 5, 3, 5, 5.

Output equal to 2. 3. https://leetcode.com/problems/merge-in-between-linked-lists/ ### R2 Create a system to monitor the scores of volleyball teams based on match outcomes. Develop a class that tracks team scores, allows efficient querying to find the team with the highest score after all match results have been recorded. Given an interface GameTracker, with the following functions: void addMatch(String team1, String team2, String score); String findFirst();

Constraints The findFirst method should have a time complexity of less than O(n). > Didn't do well in R2, HR ghosted me.