PhonePe coding interview
questions, leaked.
93 problems reported across recent PhonePe interviews. Top patterns: array, dynamic programming, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
PhonePe's coding assessment hits hard and fast. You're looking at 93 problems across their hiring funnel, but here's the catch: 33 are hard and only 2 are easy. Arrays dominate at 65 problems, followed by dynamic programming at 28. That's not a coincidence. They're testing if you can spot patterns under pressure and code them without breaking. If you blank on an array-DP hybrid during the live assessment, StealthCoder runs invisibly and surfaces a working solution in seconds. But first, you need to know what actually shows up.
Top problems at PhonePe
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Frog Jump | HARD | 100.0 | 47% | Array · Dynamic Programming |
| 02 | Burst Balloons | HARD | 94.2 | 61% | Array · Dynamic Programming |
| 03 | Decoded String at Index | MEDIUM | 90.7 | 37% | String · Stack |
| 04 | Smallest Range Covering Elements from K Lists | HARD | 86.6 | 70% | Array · Hash Table · Greedy |
| 05 | Simple Bank System | MEDIUM | 86.6 | 61% | Array · Hash Table · Design |
| 06 | Maximum Tastiness of Candy Basket | MEDIUM | 86.6 | 66% | Array · Binary Search · Greedy |
| 07 | Count the Number of Arrays with K Matching Adjacent Elements | HARD | 84.3 | 59% | Math · Combinatorics |
| 08 | Maximum Amount of Money Robot Can Earn | MEDIUM | 84.3 | 29% | Array · Dynamic Programming · Matrix |
| 09 | Frequencies of Shortest Supersequences | HARD | 84.3 | 16% | Array · String · Bit Manipulation |
| 10 | Find Beautiful Indices in the Given Array II | HARD | 84.3 | 26% | Two Pointers · String · Binary Search |
| 11 | Viewers Turned Streamers | HARD | 84.3 | 43% | Database |
| 12 | Check if Point Is Reachable | HARD | 84.3 | 43% | Math · Number Theory |
| 13 | Smallest String With Swaps | MEDIUM | 84.3 | 59% | Array · Hash Table · String |
| 14 | Remove K Digits | MEDIUM | 78.8 | 35% | String · Stack · Greedy |
| 15 | Most Stones Removed with Same Row or Column | MEDIUM | 75.5 | 62% | Hash Table · Depth-First Search · Union Find |
| 16 | Bus Routes | HARD | 75.5 | 47% | Array · Hash Table · Breadth-First Search |
| 17 | Longest Palindromic Substring | MEDIUM | 71.8 | 36% | Two Pointers · String · Dynamic Programming |
| 18 | Trapping Rain Water | HARD | 71.8 | 65% | Array · Two Pointers · Dynamic Programming |
| 19 | Kth Smallest Element in a Sorted Matrix | MEDIUM | 67.3 | 64% | Array · Binary Search · Sorting |
| 20 | Frequency of the Most Frequent Element | MEDIUM | 67.3 | 44% | Array · Binary Search · Greedy |
| 21 | House Robber II | MEDIUM | 67.3 | 44% | Array · Dynamic Programming |
| 22 | Split Array Largest Sum | HARD | 67.3 | 58% | Array · Binary Search · Dynamic Programming |
| 23 | Candy | HARD | 67.3 | 47% | Array · Greedy |
| 24 | House Robber | MEDIUM | 67.3 | 52% | Array · Dynamic Programming |
| 25 | Queue Reconstruction by Height | MEDIUM | 67.3 | 74% | Array · Binary Indexed Tree · Segment Tree |
| 26 | Maximum Profit in Job Scheduling | HARD | 67.3 | 54% | Array · Binary Search · Dynamic Programming |
| 27 | Best Time to Buy and Sell Stock | EASY | 67.3 | 55% | Array · Dynamic Programming |
| 28 | Make Lexicographically Smallest Array by Swapping Elements | MEDIUM | 61.9 | 60% | Array · Union Find · Sorting |
| 29 | IPO | HARD | 61.9 | 53% | Array · Greedy · Sorting |
| 30 | Koko Eating Bananas | MEDIUM | 61.9 | 49% | Array · Binary Search |
| 31 | Amount of Time for Binary Tree to Be Infected | MEDIUM | 61.9 | 64% | Hash Table · Tree · Depth-First Search |
| 32 | Reachable Nodes In Subdivided Graph | HARD | 61.9 | 51% | Graph · Heap (Priority Queue) · Shortest Path |
| 33 | Jump Game II | MEDIUM | 61.9 | 42% | Array · Dynamic Programming · Greedy |
| 34 | Sum of Distances in Tree | HARD | 61.9 | 65% | Dynamic Programming · Tree · Depth-First Search |
| 35 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | MEDIUM | 61.9 | 57% | Array · Queue · Sliding Window |
| 36 | Split Array into Consecutive Subsequences | MEDIUM | 54.9 | 52% | Array · Hash Table · Greedy |
| 37 | Matchsticks to Square | MEDIUM | 54.9 | 41% | Array · Dynamic Programming · Backtracking |
| 38 | Sliding Window Maximum | HARD | 54.9 | 48% | Array · Queue · Sliding Window |
| 39 | Rotting Oranges | MEDIUM | 54.9 | 57% | Array · Breadth-First Search · Matrix |
| 40 | Word Ladder | HARD | 54.9 | 43% | Hash Table · String · Breadth-First Search |
| 41 | Minimum Cost to Cut a Stick | HARD | 54.9 | 62% | Array · Dynamic Programming · Sorting |
| 42 | Best Time to Buy and Sell Stock III | HARD | 54.9 | 51% | Array · Dynamic Programming |
| 43 | House Robber III | MEDIUM | 54.9 | 55% | Dynamic Programming · Tree · Depth-First Search |
| 44 | Sort Colors | MEDIUM | 54.9 | 68% | Array · Two Pointers · Sorting |
| 45 | Distribute Coins in Binary Tree | MEDIUM | 54.9 | 77% | Tree · Depth-First Search · Binary Tree |
| 46 | Maximal Square | MEDIUM | 54.9 | 49% | Array · Dynamic Programming · Matrix |
| 47 | Swim in Rising Water | HARD | 54.9 | 63% | Array · Binary Search · Depth-First Search |
| 48 | Accounts Merge | MEDIUM | 54.9 | 60% | Array · Hash Table · String |
| 49 | Merge Intervals | MEDIUM | 54.9 | 49% | Array · Sorting |
| 50 | Find Duplicate Subtrees | MEDIUM | 45.1 | 60% | Hash Table · Tree · Depth-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 PhonePe OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- array65 · 70%
- dynamic programming28 · 30%
- hash table22 · 24%
- sorting20 · 22%
- string17 · 18%
- depth first search15 · 16%
- breadth first search15 · 16%
- greedy14 · 15%
- binary search14 · 15%
- graph10 · 11%
PhonePe leans heavily into array problems (70 percent of their test set) combined with dynamic programming and hash tables. This isn't about memorizing solutions. It's about recognizing when to use a sliding window, when to build a DP table, when to hash for O(1) lookups. Problems like Frog Jump, Burst Balloons, and Smallest Range Covering Elements from K Lists show they care about optimization and trade-offs. Sorting and greedy round out the middle tier. Depth-first search and breadth-first search appear in 15 problems each, so graph traversal matters but it's secondary. If you've drilled arrays and DP, you're ahead. If you hit a pattern you haven't seen before mid-assessment, StealthCoder is your invisible net. The median problem is hard and multi-topic, so expect to combine skills on the clock.
Companies with similar patterns
If you prepped for PhonePe, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass PhonePe.
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 for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
PhonePe interview FAQ
How many array problems should I solve before the PhonePe assessment?+
At least 20 to 25. Arrays represent 70 percent of their problem set. Focus on sliding window, two-pointer, and prefix-sum patterns. Skip breadth-first search drills if time is tight. Array fundamentals will carry you further here.
Is dynamic programming essential for PhonePe, or can I skip it?+
Don't skip it. DP appears in 28 problems and often pairs with arrays (Frog Jump, Burst Balloons, Maximum Amount of Money Robot Can Earn). If you're weak on DP, you'll hit a wall mid-assessment. Drill classic DP states and memoization first.
What's the balance between easy, medium, and hard problems at PhonePe?+
Only 2 easy problems in their entire set. 58 medium, 33 hard. You won't get warm-up gimmes. Expect a medium-to-hard jump from problem one. Practice under pressure and don't panic when the first problem feels non-trivial.
Should I study union-find and heap problems, or focus elsewhere?+
Union-find and heaps each appear in about 9 problems. They're secondary. Nail arrays, DP, hash tables, and sorting first. If you have spare prep time, union-find shows up in graph and connected-component problems, so it's worth a weekend.
How much time should I spend on string and graph problems?+
String has 17 problems, graph has 10. String is mid-priority. Graph is lower. Don't spend equal time. Prioritize array and DP drills. Graph problems at PhonePe often use DFS or union-find as a secondary skill, not the main event.