J.P. Morgan coding interview
questions, leaked.
79 problems reported across recent J.P. Morgan interviews. Top patterns: array, string, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
J.P. Morgan's coding interviews are array and string heavy. Out of 79 reported problems, 45 focus on arrays and 25 on strings. The difficulty split is brutal: 47 medium problems, 27 easy ones, and 5 hard ones that can tank your entire assessment. Most candidates burn time on the medium tier because they haven't drilled the patterns. If you hit a wall on a greedy or hash-table problem during the live assessment, StealthCoder runs invisibly on screen share and surfaces a working solution in seconds. That's your hedge for whatever pattern didn't stick.
Top problems at J.P. Morgan
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Sort Integers by The Number of 1 Bits | EASY | 100.0 | 79% | Array · Bit Manipulation · Sorting |
| 02 | Reaching Points | HARD | 96.5 | 34% | Math |
| 03 | Least Number of Unique Integers after K Removals | MEDIUM | 93.1 | 63% | Array · Hash Table · Greedy |
| 04 | Minimum Suffix Flips | MEDIUM | 90.8 | 73% | String · Greedy |
| 05 | Remove Colored Pieces if Both Neighbors are the Same Color | MEDIUM | 89.1 | 63% | Math · String · Greedy |
| 06 | Break a Palindrome | MEDIUM | 86.2 | 52% | String · Greedy |
| 07 | Next Permutation | MEDIUM | 82.9 | 43% | Array · Two Pointers |
| 08 | Check Whether Two Strings are Almost Equivalent | EASY | 82.9 | 64% | Hash Table · String · Counting |
| 09 | Minimum Absolute Difference | EASY | 82.9 | 71% | Array · Sorting |
| 10 | Group Anagrams | MEDIUM | 77.6 | 71% | Array · Hash Table · String |
| 11 | Best Time to Buy and Sell Stock | EASY | 76.0 | 55% | Array · Dynamic Programming |
| 12 | Numbers With Repeated Digits | HARD | 74.3 | 43% | Math · Dynamic Programming |
| 13 | Determine Color of a Chessboard Square | EASY | 74.3 | 79% | Math · String |
| 14 | Minimum Swaps to Make Strings Equal | MEDIUM | 74.3 | 65% | Math · String · Greedy |
| 15 | Merge Intervals | MEDIUM | 72.4 | 49% | Array · Sorting |
| 16 | Rotate Image | MEDIUM | 70.4 | 78% | Array · Math · Matrix |
| 17 | Button with Longest Push Time | EASY | 70.4 | 41% | Array |
| 18 | Valid Parentheses | EASY | 70.4 | 42% | String · Stack |
| 19 | Display Table of Food Orders in a Restaurant | MEDIUM | 70.4 | 76% | Array · Hash Table · String |
| 20 | Check if Number Has Equal Digit Count and Digit Value | EASY | 70.4 | 72% | Hash Table · String · Counting |
| 21 | Suspicious Bank Accounts | MEDIUM | 70.4 | 45% | Database |
| 22 | Lexicographically Smallest String After Applying Operations | MEDIUM | 70.4 | 65% | String · Depth-First Search · Breadth-First Search |
| 23 | Lexicographically Smallest String After a Swap | EASY | 70.4 | 54% | String · Greedy |
| 24 | Maximum Number of Points From Grid Queries | HARD | 70.4 | 60% | Array · Two Pointers · Breadth-First Search |
| 25 | Reverse Odd Levels of Binary Tree | MEDIUM | 70.4 | 87% | Tree · Depth-First Search · Breadth-First Search |
| 26 | Find Resultant Array After Removing Anagrams | EASY | 68.1 | 59% | Array · Hash Table · String |
| 27 | Longest Palindromic Substring | MEDIUM | 65.6 | 36% | Two Pointers · String · Dynamic Programming |
| 28 | Count Numbers with Unique Digits | MEDIUM | 62.8 | 54% | Math · Dynamic Programming · Backtracking |
| 29 | Longest Substring Without Repeating Characters | MEDIUM | 59.5 | 37% | Hash Table · String · Sliding Window |
| 30 | Happy Number | EASY | 59.5 | 58% | Hash Table · Math · Two Pointers |
| 31 | Maximum Product of Two Elements in an Array | EASY | 55.6 | 83% | Array · Sorting · Heap (Priority Queue) |
| 32 | Climbing Stairs | EASY | 55.6 | 54% | Math · Dynamic Programming · Memoization |
| 33 | Rearrange Array to Maximize Prefix Score | MEDIUM | 50.9 | 42% | Array · Greedy · Sorting |
| 34 | Intersection of Two Arrays | EASY | 50.9 | 76% | Array · Hash Table · Two Pointers |
| 35 | Maximum Units on a Truck | EASY | 50.9 | 74% | Array · Greedy · Sorting |
| 36 | Minimum Operations to Make All Array Elements Equal | MEDIUM | 50.9 | 37% | Array · Binary Search · Sorting |
| 37 | Subarray Sum Equals K | MEDIUM | 50.9 | 45% | Array · Hash Table · Prefix Sum |
| 38 | Fizz Buzz | EASY | 50.9 | 74% | Math · String · Simulation |
| 39 | Two Sum | EASY | 50.9 | 56% | Array · Hash Table |
| 40 | Maximum Subarray | MEDIUM | 50.9 | 52% | Array · Divide and Conquer · Dynamic Programming |
| 41 | Generate Parentheses | MEDIUM | 50.9 | 77% | String · Dynamic Programming · Backtracking |
| 42 | Best Time to Buy and Sell Stock II | MEDIUM | 50.9 | 70% | Array · Dynamic Programming · Greedy |
| 43 | LRU Cache | MEDIUM | 44.8 | 45% | Hash Table · Linked List · Design |
| 44 | Daily Temperatures | MEDIUM | 44.8 | 67% | Array · Stack · Monotonic Stack |
| 45 | Minimum Cost to Connect Sticks | MEDIUM | 44.8 | 71% | Array · Greedy · Heap (Priority Queue) |
| 46 | Minimum Cost to Make Array Equal | HARD | 44.8 | 46% | Array · Binary Search · Greedy |
| 47 | Coin Change | MEDIUM | 44.8 | 46% | Array · Dynamic Programming · Breadth-First Search |
| 48 | Fibonacci Number | EASY | 44.8 | 73% | Math · Dynamic Programming · Recursion |
| 49 | Pascal's Triangle | EASY | 44.8 | 77% | Array · Dynamic Programming |
| 50 | Binary Tree Right Side View | MEDIUM | 44.8 | 67% | Tree · Depth-First Search · Breadth-First Search |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual J.P. Morgan OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array45 · 57%
- string25 · 32%
- hash table20 · 25%
- sorting19 · 24%
- math16 · 20%
- dynamic programming15 · 19%
- greedy14 · 18%
- two pointers9 · 11%
- heap priority queue6 · 8%
- binary search6 · 8%
Array manipulation dominates J.P. Morgan's assessment. Problems like Sort Integers by The Number of 1 Bits, Next Permutation, and Merge Intervals sit right at the median difficulty level, which means they're quick confidence boosters if you've seen them before and confidence killers if you haven't. Strings and hash tables follow close behind, with greedy algorithms weaving through both. The hard problems (Reaching Points, Numbers With Repeated Digits) blend math and dynamic programming in ways that feel unfamiliar under pressure. Sorting and two-pointers appear frequently too, but are simpler to drill. Focus on arrays first, then string-hash-table combos. When you're live and a greedy algorithm problem feels opaque, StealthCoder is the safety net.
Companies with similar patterns
If you prepped for J.P. Morgan, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass J.P. Morgan.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
J.P. Morgan interview FAQ
Should I prioritize arrays over other topics for J.P. Morgan?+
Yes. Arrays account for 45 of 79 problems. String comes next at 25. If you can confidently solve array problems involving sorting, two-pointers, and dynamic programming, you'll cover most of the assessment. Start there, then move to string-hash-table patterns.
How much time should I spend on hard problems before my interview?+
Hard problems are only 5 of 79 total, but they're high-impact. Reaching Points and Numbers With Repeated Digits both require math reasoning under time pressure. Spend time on one or two, but don't let them dominate your prep. Medium problems are your real battle.
Is greedy a major topic for J.P. Morgan?+
Greedy appears in 14 problems and overlaps heavily with strings and arrays. Problems like Least Number of Unique Integers after K Removals and Break a Palindrome test greedy thinking at medium difficulty. It's not the largest topic, but it's frequent enough that you can't skip it.
What's the ratio of easy to medium problems I'll face?+
J.P. Morgan's dataset is 34% easy, 59% medium, 6% hard. The easy problems are warm-ups. The medium tier is where the assessment is won or lost. Don't assume easy problems buy you time to relax on harder ones.
Do I need to be strong in dynamic programming for this interview?+
Dynamic programming appears in 15 problems, often paired with arrays or math. Best Time to Buy and Sell Stock and Numbers With Repeated Digits are examples. It's useful but not dominant. Master arrays and strings first, then pick up DP patterns if you have time.