JPMorgan SE3 6 YOE Reject Q4 2025
- Experience
- 6 years
- Posted
- 12 Jan 2026
Summary
I interviewed for a Software Engineer 3 position at JPMorgan, which involved two coding rounds and one system design round. I was ultimately rejected after not performing well in the system design round.
How it went
YOE 6 at FAANG
R1:
- Project details and then two coding questions.
- 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.
- 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.
Questions asked (3)
- 01
Minimize Partitions for Data Storage
Data Structures & Algorithms
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.
- 02
Merge In Between Linked Lists
Data Structures & Algorithms
Open the problemA standard LeetCode problem, details available at the provided link.
- 03
GameTracker System Design
System Design
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).