PhonePe
92 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 312. Burst Balloons | Hard | 63.9% | TopicsArrayDynamic Programming |
| Queue Reconstruction by Height | Medium | 63.9% | TopicsArrayBinary Indexed TreeSegment TreeSorting |
| Smallest Range Covering Elements from K Lists | Hard | 63.9% | TopicsArrayHash TableGreedySliding WindowSortingHeap (Priority Queue) |
| Kth Smallest Element in a Sorted Matrix | Medium | 63.9% | TopicsArrayBinary SearchSortingHeap (Priority Queue)Matrix |
| 1590. Make Sum Divisible by P | Medium | 63.9% | TopicsArrayHash TablePrefix Sum |
| Maximal Square | Medium | 63.9% | TopicsArrayDynamic ProgrammingMatrix |
| 659. Split Array into Consecutive Subsequences | Medium | 63.9% | TopicsArrayHash TableGreedyHeap (Priority Queue) |
| Asteroid Collision | Medium | 63.9% | TopicsArrayStackSimulation |
| 57. Insert Interval | Medium | 63.9% | TopicsArray |
| 1664. Ways to Make a Fair Array | Medium | 63.9% | TopicsArrayPrefix Sum |
| 49. Group Anagrams | Medium | 63.9% | TopicsArrayHash TableStringSorting |
| Evaluate Division | Medium | 63.9% | TopicsArrayStringDepth-First SearchBreadth-First SearchUnion-FindGraph TheoryShortest PathBellman–Ford AlgorithmFloyd–Warshall Algorithm |
| 2251. Number of Flowers in Full Bloom | Hard | 63.9% | TopicsArrayHash TableBinary SearchSortingPrefix SumOrdered Set |
| 851. Loud and Rich | Medium | 63.9% | TopicsArrayDepth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| 2858. Minimum Edge Reversals So Every Node Is Reachable | Hard | 63.9% | TopicsDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph Theory |
| 134. Gas Station | Medium | 63.9% | TopicsArrayGreedy |
| 1642. Furthest Building You Can Reach | Medium | 63.9% | TopicsArrayGreedyHeap (Priority Queue) |
| 3Sum | Medium | 63.9% | TopicsArrayTwo PointersSorting |
| 20. Valid Parentheses | Easy | 63.9% | TopicsStringStackBracket Sequences |
| 853. Car Fleet | Medium | 63.9% | TopicsArrayStackSortingMonotonic Stack |
| Cherry Pickup | Hard | 63.9% | TopicsArrayDynamic ProgrammingMatrix |
| 1423. Maximum Points You Can Obtain from Cards | Medium | 63.9% | TopicsArraySliding WindowPrefix Sum |
| 14. Longest Common Prefix | Easy | 63.9% | TopicsArrayStringTrie |
| 332. Reconstruct Itinerary | Hard | 63.9% | TopicsArrayStringDepth-First SearchGraph TheorySortingHeap (Priority Queue)Eulerian CircuitEulerian PathSemi-Eulerian Graph |
| 1928. Minimum Cost to Reach Destination in Time | Hard | 63.9% | TopicsArrayDynamic ProgrammingGraph TheoryDijkstra's Algorithm |
