Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
Interview question tracker
PhonePe SDE 1
The 50 highest-frequency questions from all time. Finish the strongest signals first.
Top questions 50
| Done | Question | LeetCode |
|---|---|---|
| Count the Number of Arrays with K Matching Adjacent Elements | Solve | |
| Find Beautiful Indices in the Given Array II | Solve | |
| Frequencies of Shortest Supersequences | Solve | |
| Maximum Amount of Money Robot Can Earn | Solve | |
| Most Stones Removed with Same Row or Column | Solve | |
| Viewers Turned Streamers | Solve | |
| Smallest Range Covering Elements from K Lists | Solve | |
| Check if Point Is Reachable | Solve | |
| Maximum Tastiness of Candy Basket | Solve | |
| Simple Bank System | Solve | |
| Smallest String With Swaps | Solve | |
| Longest Palindromic Substring | Solve | |
| Minimum Number of Days to Make m Bouquets | Solve | |
| Bus Routes | Solve | |
| Remove K Digits | Solve | |
| Sum of Distances in Tree | Solve | |
| Maximum Profit in Job Scheduling | Solve | |
| Collect Coins in a Tree | Solve | |
| Distribute Candies Among Children II | Solve | |
| Jump Game II | Solve | |
| Kth Smallest Element in a Sorted Matrix | Solve | |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Solve | |
| LRU Cache | Solve | |
| Make Lexicographically Smallest Array by Swapping Elements | Solve | |
| Matchsticks to Square | Solve | |
| Number of Flowers in Full Bloom | Solve | |
| Trapping Rain Water | Solve | |
| Zuma Game | Solve | |
| 3Sum | Solve | |
| Asteroid Collision | Solve | |
| Burst Balloons | Solve | |
| Car Fleet | Solve | |
| Cherry Pickup | Solve | |
| Determine if Two Strings Are Close | Solve | |
| Evaluate Division | Solve | |
| Furthest Building You Can Reach | Solve | |
| Gas Station | Solve | |
| Group Anagrams | Solve | |
| House Robber | Solve | |
| Loud and Rich | Solve | |
| Make Sum Divisible by P | Solve | |
| Maximal Square | Solve | |
| Maximum Performance of a Team | Solve | |
| Maximum Points You Can Obtain from Cards | Solve | |
| Minimum Cost to Reach Destination in Time | Solve | |
| Minimum Edge Reversals So Every Node Is Reachable | Solve | |
| Number of Operations to Make Network Connected | Solve | |
| Queue Reconstruction by Height | Solve | |
| Reconstruct Itinerary | Solve | |
| Rotting Oranges | Solve |
Showing the 50 highest-frequency questions from 95 reported in this period.