DSA Doctor
Verified Company Vault
30d Active
Jpmorgan DSA Interview Questions
72 curated coding interview questions directly asked in Jpmorgan technical rounds, sorted by frequency with recency and difficulty diagnostics.
72
Total Questions
23 (32%)
Easy Problems
42 (58%)
Medium Problems
7 (10%)
Hard Problems
🔥 Most Tested Topics:
Arrays (32)Core DSA (20)Strings (17)Trees (5)Greedy (3)
📂 Sourced Datasets:
Last 30 daysLast 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 100.0% | 30d |
| 2182 | Construct String With Repeat Limit | Medium | Strings | Hashing / Sliding Window | 70.8% | 100.0% | 3m |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 100.0% | 3m |
| 696 | Count Binary Substrings | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 70.4% | 100.0% | 6m |
| 1710 | Maximum Units on a Truck | Easy | Arrays | Sorting / Prefix / Scan | 74.9% | 87.5% | 3m |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 87.5% | 6m |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 75.0% | 3m |
| 678 | Valid Parenthesis String | Medium | Strings | Hashing / Sliding Window | 40.1% | 75.0% | 3m |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | 3m |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 75.0% | 3m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | 3m |
| 2491 | Divide Players Into Teams of Equal Skill | Medium | Core DSA | Implementation / Reasoning | 68.9% | 75.0% | 6m |
| 2283 | Check if Number Has Equal Digit Count and Digit Value | Easy | Core DSA | Implementation / Reasoning | 73.2% | 75.0% | all |
| 1247 | Minimum Swaps to Make Strings Equal | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 65.4% | 75.0% | all |
| 2415 | Reverse Odd Levels of Binary Tree | Medium | Trees | DFS / BFS | 86.6% | 75.0% | all |
| 1418 | Display Table of Food Orders in a Restaurant | Medium | Core DSA | Implementation / Reasoning | 76.4% | 75.0% | all |
| 2503 | Maximum Number of Points From Grid Queries | Hard | Arrays | Sorting / Prefix / Scan | 59.3% | 75.0% | all |
| 1625 | Lexicographically Smallest String After Applying Operations | Medium | Strings; Graphs | Hashing / Sliding Window; BFS / DFS / Topological Sort | 79.3% | 75.0% | all |
| 1812 | Determine Color of a Chessboard Square | Easy | Core DSA | Implementation / Reasoning | 79.9% | 75.0% | all |
| 1843 | Suspicious Bank Accounts | Medium | Core DSA | Implementation / Reasoning | 44.1% | 75.0% | all |
| 3216 | Lexicographically Smallest String After a Swap | Easy | Strings; Graphs | Hashing / Sliding Window; BFS / DFS / Topological Sort | 54.6% | 75.0% | all |
| 3386 | Button with Longest Push Time | Easy | Core DSA | Implementation / Reasoning | 41.1% | 75.0% | all |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 82.5% | 75.0% | all |
| 3818 | Minimum Prefix Removal to Make Array Strictly Increasing | Medium | Arrays | Sorting / Prefix / Scan | 73.9% | 75.0% | all |
| 2054 | Two Best Non-Overlapping Events | Medium | Greedy | Greedy | 64.0% | 62.5% | 6m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | 6m |
| 1529 | Minimum Suffix Flips | Medium | Arrays | Sorting / Prefix / Scan | 73.9% | 62.5% | 6m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | 6m |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 62.5% | all |
| 1200 | Minimum Absolute Difference | Easy | Arrays | Sorting / Prefix / Scan | 75.1% | 62.5% | all |
| 2273 | Find Resultant Array After Removing Anagrams | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 69.9% | 62.5% | all |
| 2602 | Minimum Operations to Make All Array Elements Equal | Medium | Arrays | Sorting / Prefix / Scan | 38.4% | 62.5% | all |
| 1464 | Maximum Product of Two Elements in an Array | Easy | Arrays | Sorting / Prefix / Scan | 83.6% | 62.5% | all |
| 2587 | Rearrange Array to Maximize Prefix Score | Medium | Arrays | Sorting / Prefix / Scan | 42.8% | 62.5% | all |
| 3147 | Taking Maximum Energy From the Mystic Dungeon | Medium | Arrays | Sorting / Prefix / Scan | 61.0% | 62.5% | all |
| 1974 | Minimum Time to Type Word Using Special Typewriter | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 78.7% | 62.5% | all |
| 1208 | Get Equal Substrings Within Budget | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 59.7% | 62.5% | all |
| 1167 | Minimum Cost to Connect Sticks | Medium | Arrays | Sorting / Prefix / Scan | 71.9% | 50.0% | all |
| 780 | Reaching Points | Hard | Core DSA | Implementation / Reasoning | 34.4% | 50.0% | all |
| 384 | Shuffle an Array | Medium | Arrays | Sorting / Prefix / Scan | 59.7% | 50.0% | all |
| 2270 | Number of Ways to Split Array | Medium | Arrays | Sorting / Prefix / Scan | 55.9% | 50.0% | all |
| 476 | Number Complement | Easy | Core DSA | Implementation / Reasoning | 70.4% | 50.0% | all |
| 115 | Distinct Subsequences | Hard | Core DSA | Implementation / Reasoning | 51.9% | 50.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 50.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 37.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 37.5% | all |
| 122 | Best Time to Buy and Sell Stock II | Medium | Core DSA | Implementation / Reasoning | 71.1% | 37.5% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 37.5% | all |
| 349 | Intersection of Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 77.8% | 37.5% | all |
| 412 | Fizz Buzz | Easy | Core DSA | Implementation / Reasoning | 75.5% | 37.5% | all |
| 435 | Non-overlapping Intervals | Medium | Arrays; Greedy | Sorting / Prefix / Scan; Greedy | 57.1% | 37.5% | all |
| 1012 | Numbers With Repeated Digits | Hard | Core DSA | Implementation / Reasoning | 46.6% | 37.5% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 37.5% | all |
| 167 | Two Sum II - Input Array Is Sorted | Medium | Arrays | Sorting / Prefix / Scan; Two Pointers | 65.1% | 37.5% | all |
| 3159 | Find Occurrences of an Element in an Array | Medium | Arrays | Sorting / Prefix / Scan | 73.4% | 37.5% | all |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 37.5% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 37.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 37.5% | all |
| 1535 | Find the Winner of an Array Game | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 37.5% | all |
| 974 | Subarray Sums Divisible by K | Medium | Arrays | Sorting / Prefix / Scan | 56.3% | 37.5% | all |
| 1046 | Last Stone Weight | Easy | Core DSA | Implementation / Reasoning | 66.5% | 37.5% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 37.5% | all |
| 1648 | Sell Diminishing-Valued Colored Balls | Medium | Core DSA | Implementation / Reasoning | 30.2% | 37.5% | all |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 37.5% | all |
| 1629 | Slowest Key | Easy | Core DSA | Implementation / Reasoning | 59.6% | 37.5% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 37.5% | all |
| 643 | Maximum Average Subarray I | Easy | Arrays | Sorting / Prefix / Scan | 47.8% | 37.5% | all |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | Medium | Arrays | Sorting / Prefix / Scan | 43.0% | 37.5% | all |
| 118 | Pascal's Triangle | Easy | Core DSA | Implementation / Reasoning | 78.9% | 37.5% | all |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 37.5% | all |
| 912 | Sort an Array | Medium | Arrays | Sorting / Prefix / Scan | 55.9% | 37.5% | all |