DSA Doctor
Verified Company Vault
Phonepe DSA Interview Questions
102 curated coding interview questions directly asked in Phonepe technical rounds, sorted by frequency with recency and difficulty diagnostics.
102
Total Questions
4 (4%)
Easy Problems
60 (59%)
Medium Problems
38 (37%)
Hard Problems
🔥 Most Tested Topics:
Arrays (37)Core DSA (37)Strings (9)Trees (8)Dynamic Programming (8)
📂 Sourced Datasets:
Last 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1423 | Maximum Points You Can Obtain from Cards | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 100.0% | 6m |
| 2517 | Maximum Tastiness of Candy Basket | Medium | Arrays | Sorting / Prefix / Scan | 68.2% | 100.0% | all |
| 2543 | Check if Point Is Reachable | Hard | Core DSA | Implementation / Reasoning | 45.1% | 100.0% | all |
| 2043 | Simple Bank System | Medium | Core DSA | Implementation / Reasoning | 69.7% | 100.0% | all |
| 1202 | Smallest String With Swaps | Medium | Strings | Hashing / Sliding Window | 60.6% | 100.0% | all |
| 2995 | Viewers Turned Streamers | Hard | Core DSA | Implementation / Reasoning | 42.9% | 100.0% | all |
| 3008 | Find Beautiful Indices in the Given Array II | Hard | Arrays | Sorting / Prefix / Scan | 27.9% | 100.0% | all |
| 632 | Smallest Range Covering Elements from K Lists | Hard | Linked List | Two Pointers | 70.1% | 100.0% | all |
| 3405 | Count the Number of Arrays with K Matching Adjacent Elements | Hard | Arrays | Sorting / Prefix / Scan | 58.2% | 100.0% | all |
| 3418 | Maximum Amount of Money Robot Can Earn | Medium | Arrays | Sorting / Prefix / Scan | 47.8% | 100.0% | all |
| 3435 | Frequencies of Shortest Supersequences | Hard | Core DSA | Implementation / Reasoning | 22.4% | 100.0% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 87.5% | 6m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 87.5% | 6m |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 87.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 87.5% | all |
| 815 | Bus Routes | Hard | Core DSA | Implementation / Reasoning | 47.3% | 87.5% | all |
| 402 | Remove K Digits | Medium | Core DSA | Implementation / Reasoning | 36.9% | 87.5% | all |
| 947 | Most Stones Removed with Same Row or Column | Medium | Core DSA | Implementation / Reasoning | 62.9% | 87.5% | all |
| 834 | Sum of Distances in Tree | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 65.6% | 87.5% | all |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium | Arrays | Sorting / Prefix / Scan | 56.6% | 87.5% | all |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 75.0% | all |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 75.0% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 75.0% | all |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 75.0% | all |
| 880 | Decoded String at Index | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 37.3% | 75.0% | all |
| 882 | Reachable Nodes In Subdivided Graph | Hard | Trees; Graphs | DFS / BFS; BFS / DFS / Topological Sort | 52.1% | 75.0% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 75.0% | all |
| 378 | Kth Smallest Element in a Sorted Matrix | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 64.6% | 75.0% | all |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | Medium | Arrays; Graphs | Sorting / Prefix / Scan; BFS / DFS / Topological Sort | 60.3% | 75.0% | all |
| 473 | Matchsticks to Square | Medium | Core DSA | Implementation / Reasoning | 41.9% | 75.0% | all |
| 488 | Zuma Game | Hard | Core DSA | Implementation / Reasoning | 29.7% | 75.0% | all |
| 2929 | Distribute Candies Among Children II | Medium | Core DSA | Implementation / Reasoning | 55.6% | 75.0% | all |
| 2603 | Collect Coins in a Tree | Hard | Trees; Dynamic Programming | DFS / BFS; State Transition | 40.1% | 75.0% | all |
| 135 | Candy | Hard | Core DSA | Implementation / Reasoning | 48.5% | 62.5% | all |
| 312 | Burst Balloons | Hard | Core DSA | Implementation / Reasoning | 63.5% | 62.5% | all |
| 337 | House Robber III | Medium | Dynamic Programming | State Transition | 55.9% | 62.5% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 62.5% | all |
| 406 | Queue Reconstruction by Height | Medium | Stack / Queue | Monotonic Stack / Simulation | 74.7% | 62.5% | all |
| 1838 | Frequency of the Most Frequent Element | Medium | Core DSA | Implementation / Reasoning | 44.8% | 62.5% | all |
| 1590 | Make Sum Divisible by P | Medium | Arrays | Sorting / Prefix / Scan | 42.6% | 62.5% | all |
| 221 | Maximal Square | Medium | Core DSA | Implementation / Reasoning | 50.3% | 62.5% | all |
| 3186 | Maximum Total Damage With Spell Casting | Medium | Arrays | Sorting / Prefix / Scan | 45.1% | 62.5% | all |
| 659 | Split Array into Consecutive Subsequences | Medium | Arrays | Sorting / Prefix / Scan | 52.1% | 62.5% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 62.5% | all |
| 1383 | Maximum Performance of a Team | Hard | Arrays | Sorting / Prefix / Scan | 47.8% | 62.5% | all |
| 1664 | Ways to Make a Fair Array | Medium | Arrays | Sorting / Prefix / Scan | 66.9% | 62.5% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | all |
| 399 | Evaluate Division | Medium | Core DSA | Implementation / Reasoning | 64.2% | 62.5% | all |
| 2251 | Number of Flowers in Full Bloom | Hard | Core DSA | Implementation / Reasoning | 57.9% | 62.5% | all |
| 851 | Loud and Rich | Medium | Core DSA | Implementation / Reasoning | 63.5% | 62.5% | all |
| 1657 | Determine if Two Strings Are Close | Medium | Strings | Hashing / Sliding Window | 54.3% | 62.5% | all |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 59.5% | 62.5% | all |
| 1319 | Number of Operations to Make Network Connected | Medium | Graphs | BFS / DFS / Topological Sort | 66.5% | 62.5% | all |
| 134 | Gas Station | Medium | Greedy | Greedy | 48.0% | 62.5% | all |
| 1642 | Furthest Building You Can Reach | Medium | Core DSA | Implementation / Reasoning | 50.9% | 62.5% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 62.5% | all |
| 853 | Car Fleet | Medium | Core DSA | Implementation / Reasoning | 55.1% | 62.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 50.0% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 50.0% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 50.0% | all |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 50.0% | all |
| 721 | Accounts Merge | Medium | Arrays | Sorting / Prefix / Scan | 61.3% | 50.0% | all |
| 410 | Split Array Largest Sum | Hard | Arrays | Sorting / Prefix / Scan | 60.4% | 50.0% | all |
| 502 | IPO | Hard | Core DSA | Implementation / Reasoning | 53.5% | 50.0% | all |
| 639 | Decode Ways II | Hard | Dynamic Programming | State Transition | 31.9% | 50.0% | all |
| 874 | Walking Robot Simulation | Medium | Core DSA | Implementation / Reasoning | 64.6% | 50.0% | all |
| 1130 | Minimum Cost Tree From Leaf Values | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 67.9% | 50.0% | all |
| 2968 | Apply Operations to Maximize Frequency Score | Hard | Core DSA | Implementation / Reasoning | 38.9% | 50.0% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 50.0% | all |
| 652 | Find Duplicate Subtrees | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 60.7% | 50.0% | all |
| 57 | Insert Interval | Medium | Arrays | Sorting / Prefix / Scan | 45.2% | 50.0% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 50.0% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 50.0% | all |
| 475 | Heaters | Medium | Core DSA | Implementation / Reasoning | 41.9% | 50.0% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 50.0% | all |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard | Arrays | Sorting / Prefix / Scan | 63.5% | 50.0% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 50.0% | all |
| 2608 | Shortest Cycle in a Graph | Hard | Graphs; Linked List | BFS / DFS / Topological Sort; Two Pointers | 39.7% | 50.0% | all |
| 2484 | Count Palindromic Subsequences | Hard | Core DSA | Implementation / Reasoning | 41.2% | 50.0% | all |
| 3608 | Minimum Time for K Connected Components | Medium | Arrays; Graphs | Sorting / Prefix / Scan; BFS / DFS / Topological Sort | 45.4% | 50.0% | all |
| 2360 | Longest Cycle in a Graph | Hard | Graphs; Linked List | BFS / DFS / Topological Sort; Two Pointers | 50.7% | 50.0% | all |
| 514 | Freedom Trail | Hard | Core DSA | Implementation / Reasoning | 59.4% | 50.0% | all |
| 523 | Continuous Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 31.4% | 50.0% | all |
| 864 | Shortest Path to Get All Keys | Hard | Core DSA | Implementation / Reasoning | 54.6% | 50.0% | all |
| 546 | Remove Boxes | Hard | Core DSA | Implementation / Reasoning | 49.4% | 50.0% | all |
| 10 | Regular Expression Matching | Hard | Core DSA | Implementation / Reasoning | 31.0% | 50.0% | all |
| 542 | 01 Matrix | Medium | Arrays | Sorting / Prefix / Scan | 53.9% | 50.0% | all |
| 2104 | Sum of Subarray Ranges | Medium | Arrays | Sorting / Prefix / Scan | 61.1% | 50.0% | all |
| 1035 | Uncrossed Lines | Medium | Core DSA | Implementation / Reasoning | 65.3% | 50.0% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 50.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |
| 741 | Cherry Pickup | Hard | Core DSA | Implementation / Reasoning | 39.5% | 50.0% | all |
| 329 | Longest Increasing Path in a Matrix | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 56.6% | 50.0% | all |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 50.0% | all |
| 803 | Bricks Falling When Hit | Hard | Core DSA | Implementation / Reasoning | 37.2% | 50.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 50.0% | all |
| 2385 | Amount of Time for Binary Tree to Be Infected | Medium | Trees | DFS / BFS | 65.4% | 50.0% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 50.0% | all |
| 305 | Number of Islands II | Hard | Graphs | BFS / DFS / Topological Sort | 40.6% | 50.0% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 50.0% | all |
| 862 | Shortest Subarray with Sum at Least K | Hard | Arrays | Sorting / Prefix / Scan | 32.8% | 50.0% | all |