JPMorgan Coding Interview Questions
25 JPMorgan coding interview problems with full optimal solutions — 14 easy, 10 medium, 1 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an JPMorgan interviewer values, and a FAQ section.
Showing 1 problem of 25
- #239hardfrequently asked
239. Sliding Window Maximum
For an array and window size k, return the maximum of each contiguous k-window. JPMorgan asks this on senior SDE and quant-tech loops because the monotonic-deque solution is the canonical example of amortised O(n) and maps directly to streaming-max on a tick feed.
3 free resourcesSolve →