PhonePe LeetCode Questions
93 questions all-time · 2 easy · 58 medium · 33 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Frog Jump Array, Dynamic Programming | Hard | 100 | 46.6% |
| 2 | Burst Balloons Array, Dynamic Programming | Hard | 94 | 61.3% |
| 3 | Decoded String at Index String, Stack | Medium | 91 | 36.6% |
| 4 | Maximum Tastiness of Candy Basket Array, Binary Search, Greedy, Sorting | Medium | 87 | 66.1% |
| 5 | Simple Bank System Array, Hash Table, Design, Simulation | Medium | 87 | 61.4% |
| 6 | Smallest Range Covering Elements from K Lists Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue) | Hard | 87 | 69.7% |
| 7 | Viewers Turned Streamers Database | Hard | 84 | 42.9% |
| 8 | Frequencies of Shortest Supersequences Array, String, Bit Manipulation, Graph, Topological Sort, Enumeration | Hard | 84 | 15.8% |
| 9 | Smallest String With Swaps Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union Find, Sorting | Medium | 84 | 59.4% |
| 10 | Maximum Amount of Money Robot Can Earn Array, Dynamic Programming, Matrix | Medium | 84 | 28.7% |
| 11 | Check if Point Is Reachable Math, Number Theory | Hard | 84 | 43.4% |
| 12 | Count the Number of Arrays with K Matching Adjacent Elements Math, Combinatorics | Hard | 84 | 58.6% |
| 13 | Find Beautiful Indices in the Given Array II Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function | Hard | 84 | 26.5% |
| 14 | Remove K Digits String, Stack, Greedy, Monotonic Stack | Medium | 79 | 34.9% |
| 15 | Most Stones Removed with Same Row or Column Hash Table, Depth-First Search, Union Find, Graph | Medium | 76 | 62.2% |
| 16 | Bus Routes Array, Hash Table, Breadth-First Search | Hard | 76 | 47.0% |
| 17 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 72 | 65.1% |
| 18 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 72 | 35.8% |
| 19 | House Robber II Array, Dynamic Programming | Medium | 67 | 43.6% |
| 20 | Queue Reconstruction by Height Array, Binary Indexed Tree, Segment Tree, Sorting | Medium | 67 | 74.2% |
| 21 | Split Array Largest Sum Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum | Hard | 67 | 58.1% |
| 22 | Candy Array, Greedy | Hard | 67 | 46.7% |
| 23 | Frequency of the Most Frequent Element Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum | Medium | 67 | 44.1% |
| 24 | House Robber Array, Dynamic Programming | Medium | 67 | 52.3% |
| 25 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 67 | 55.3% |
| 26 | Kth Smallest Element in a Sorted Matrix Array, Binary Search, Sorting, Heap (Priority Queue), Matrix | Medium | 67 | 63.6% |
| 27 | Maximum Profit in Job Scheduling Array, Binary Search, Dynamic Programming, Sorting | Hard | 67 | 54.4% |
| 28 | Amount of Time for Binary Tree to Be Infected Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 62 | 63.7% |
| 29 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue | Medium | 62 | 56.8% |
| 30 | Reachable Nodes In Subdivided Graph Graph, Heap (Priority Queue), Shortest Path | Hard | 62 | 50.8% |
| 31 | Koko Eating Bananas Array, Binary Search | Medium | 62 | 49.1% |
| 32 | Sum of Distances in Tree Dynamic Programming, Tree, Depth-First Search, Graph | Hard | 62 | 65.3% |
| 33 | Make Lexicographically Smallest Array by Swapping Elements Array, Union Find, Sorting | Medium | 62 | 60.3% |
| 34 | IPO Array, Greedy, Sorting, Heap (Priority Queue) | Hard | 62 | 53.0% |
| 35 | Jump Game II Array, Dynamic Programming, Greedy | Medium | 62 | 41.5% |
| 36 | House Robber III Dynamic Programming, Tree, Depth-First Search, Binary Tree | Medium | 55 | 54.9% |
| 37 | Distribute Coins in Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 55 | 77.2% |
| 38 | Sort Colors Array, Two Pointers, Sorting | Medium | 55 | 67.6% |
| 39 | Merge Intervals Array, Sorting | Medium | 55 | 49.4% |
| 40 | Maximal Square Array, Dynamic Programming, Matrix | Medium | 55 | 48.8% |
| 41 | Split Array into Consecutive Subsequences Array, Hash Table, Greedy, Heap (Priority Queue) | Medium | 55 | 51.5% |
| 42 | Best Time to Buy and Sell Stock III Array, Dynamic Programming | Hard | 55 | 51.1% |
| 43 | Word Ladder Hash Table, String, Breadth-First Search | Hard | 55 | 42.8% |
| 44 | Minimum Cost to Cut a Stick Array, Dynamic Programming, Sorting | Hard | 55 | 62.0% |
| 45 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 55 | 56.6% |
| 46 | Matchsticks to Square Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Medium | 55 | 40.9% |
| 47 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 55 | 47.6% |
| 48 | Accounts Merge Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union Find, Sorting | Medium | 55 | 59.6% |
| 49 | Swim in Rising Water Array, Binary Search, Depth-First Search, Breadth-First Search, Union Find, Heap (Priority Queue), Matrix | Hard | 55 | 62.9% |
| 50 | Best Time to Buy and Sell Stock IV Array, Dynamic Programming | Hard | 45 | 47.1% |
| 51 | Evaluate Division Array, String, Depth-First Search, Breadth-First Search, Union Find, Graph, Shortest Path | Medium | 45 | 63.1% |
| 52 | Binary Tree Level Order Traversal Tree, Breadth-First Search, Binary Tree | Medium | 45 | 70.6% |
| 53 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 45 | 70.9% |
| 54 | Longest Consecutive Sequence Array, Hash Table, Union Find | Medium | 45 | 47.0% |
| 55 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 45 | 45.2% |
| 56 | Find Duplicate Subtrees Hash Table, Tree, Depth-First Search, Binary Tree | Medium | 45 | 60.1% |
| 57 | Ways to Make a Fair Array Array, Prefix Sum | Medium | 45 | 64.5% |
| 58 | First Missing Positive Array, Hash Table | Hard | 45 | 41.1% |
| 59 | Heaters Array, Two Pointers, Binary Search, Sorting | Medium | 45 | 40.0% |
| 60 | Snakes and Ladders Array, Breadth-First Search, Matrix | Medium | 45 | 47.8% |
| 61 | Sum of Subarray Minimums Array, Dynamic Programming, Stack, Monotonic Stack | Medium | 45 | 37.6% |
| 62 | Asteroid Collision Array, Stack, Simulation | Medium | 45 | 45.5% |
| 63 | Generate Parentheses String, Dynamic Programming, Backtracking | Medium | 45 | 77.1% |
| 64 | Insert Interval Array | Medium | 45 | 43.5% |
| 65 | Binary Tree Cameras Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 45 | 47.2% |
| 66 | Maximum Performance of a Team Array, Greedy, Sorting, Heap (Priority Queue) | Hard | 45 | 47.5% |
| 67 | Jump Game Array, Dynamic Programming, Greedy | Medium | 45 | 39.5% |
| 68 | Partition Array Into Two Arrays to Minimize Sum Difference Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Ordered Set, Bitmask | Hard | 45 | 21.8% |
| 69 | Largest Rectangle in Histogram Array, Stack, Monotonic Stack | Hard | 45 | 47.4% |
| 70 | Decode Ways II String, Dynamic Programming | Hard | 45 | 31.2% |
| 71 | Find Minimum Time to Finish All Jobs Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Hard | 45 | 43.5% |
| 72 | Alien Dictionary Array, String, Depth-First Search, Breadth-First Search, Graph, Topological Sort | Hard | 45 | 36.7% |
| 73 | Daily Temperatures Array, Stack, Monotonic Stack | Medium | 45 | 67.4% |
| 74 | Course Schedule II Depth-First Search, Breadth-First Search, Graph, Topological Sort | Medium | 45 | 53.4% |
| 75 | Longest Repeating Character Replacement Hash Table, String, Sliding Window | Medium | 45 | 57.2% |
| 76 | Complete Binary Tree Inserter Tree, Breadth-First Search, Design, Binary Tree | Medium | 45 | 64.5% |
| 77 | String Compression Two Pointers, String | Medium | 45 | 58.1% |
| 78 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union Find, Matrix | Medium | 45 | 62.3% |
| 79 | Magnetic Force Between Two Balls Array, Binary Search, Sorting | Medium | 45 | 71.3% |
| 80 | Number of Islands II Array, Hash Table, Union Find | Hard | 45 | 40.1% |
| 81 | Copy List with Random Pointer Hash Table, Linked List | Medium | 45 | 60.5% |
| 82 | Maximum Total Damage With Spell Casting Array, Hash Table, Two Pointers, Binary Search, Dynamic Programming, Sorting, Counting | Medium | 45 | 27.7% |
| 83 | Find All Possible Recipes from Given Supplies Array, Hash Table, String, Graph, Topological Sort | Medium | 45 | 56.5% |
| 84 | Gas Station Array, Greedy | Medium | 45 | 46.4% |
| 85 | Walking Robot Simulation Array, Hash Table, Simulation | Medium | 45 | 58.2% |
| 86 | Minimum Cost Tree From Leaf Values Array, Dynamic Programming, Stack, Greedy, Monotonic Stack | Medium | 45 | 67.7% |
| 87 | Best Time to Buy and Sell Stock II Array, Dynamic Programming, Greedy | Medium | 45 | 69.5% |
| 88 | Apply Operations to Maximize Frequency Score Array, Binary Search, Sliding Window, Sorting, Prefix Sum | Hard | 45 | 36.3% |
| 89 | Make Sum Divisible by P Array, Hash Table, Prefix Sum | Medium | 45 | 39.5% |
| 90 | Minimum Height Trees Depth-First Search, Breadth-First Search, Graph, Topological Sort | Medium | 45 | 42.0% |
| 91 | Find the Celebrity Two Pointers, Graph, Interactive | Medium | 45 | 48.4% |
| 92 | Longest Common Prefix String, Trie | Easy | 45 | 45.5% |
| 93 | Number of Flowers in Full Bloom Array, Hash Table, Binary Search, Sorting, Prefix Sum, Ordered Set | Hard | 45 | 57.2% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.