PhonePe
92 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1. Two Sum | Easy | 52.8% | TopicsArrayHash Table |
| 329. Longest Increasing Path in a Matrix | Hard | 52.8% | TopicsArrayDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryTopological SortMemoizationMatrixDirected Acyclic Graph |
| 17. Letter Combinations of a Phone Number | Medium | 52.8% | TopicsHash TableStringBacktracking |
| 200. Number of Islands | Medium | 52.8% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 54. Spiral Matrix | Medium | 52.8% | TopicsArrayMatrixSimulation |
| 2385. Amount of Time for Binary Tree to Be Infected | Medium | 52.8% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Decode String | Medium | 52.8% | TopicsStringStackRecursion |
| 862. Shortest Subarray with Sum at Least K | Hard | 52.8% | TopicsArrayBinary SearchQueueSliding WindowHeap (Priority Queue)Prefix SumMonotonic Queue |
| Frog Jump | Hard | 52.8% | TopicsArrayDynamic Programming |
| Predict the Winner | Medium | 52.8% | TopicsArrayMathDynamic ProgrammingRecursionMinimaxGame TheoryZero-Sum Game |
| 1443. Minimum Time to Collect All Apples in a Tree | Medium | 52.8% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchDP on Trees |
| 803. Bricks Falling When Hit | Hard | 52.8% | TopicsArrayUnion-FindMatrix |
| 1537. Get the Maximum Score | Hard | 52.8% | TopicsArrayTwo PointersDynamic ProgrammingGreedy |
| 91. Decode Ways | Medium | 52.8% | TopicsStringDynamic Programming |
| 297. Serialize and Deserialize Binary Tree | Hard | 52.8% | TopicsStringTreeDepth-First SearchBreadth-First SearchDesignBinary Tree |
| 2472. Maximum Number of Non-overlapping Palindrome Substrings | Hard | 52.8% | TopicsTwo PointersStringDynamic ProgrammingGreedy |
| 2101. Detonate the Maximum Bombs | Medium | 52.8% | TopicsArrayMathDepth-First SearchBreadth-First SearchGraph TheoryGeometry |
