Recently appeared for JPMorgan Chase OA (HackerRank, video proctored, 1 hour). Sharing the pattern and key observations.

OA Details:

Total Questions: 2
Time: 60 minutes
Platform: HackerRank (Video Proctored)

Q1: Graph / DSU Based (Medium)

Standard Disjoint Set Union (Union-Find) problem
Concepts used:
Path Compression
Union by Rank / Size
No tricky logic, but required clean implementation
Edge cases + multiple test cases present
If you’ve done LeetCode DSU problems, this is straightforward. Speed matters.

Q2: Design + Data Structures (Medium)

Required use of:
HashMap
Priority Queue (Heap)
LazyRemoval required
Design-based retrieval systems

Key Observations:

Questions were not very hard, but test cases were strong
Brute force would pass initial cases but fail hidden ones
and have a lots of edge case also
Optimization was necessary
Time management was the biggest factor

After OA:

AI-based interview round (behavioral / HR-type questions) not any single technical question