PhonePe
92 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2444. Count Subarrays With Fixed Bounds | Hard | 63.9% | TopicsArrayQueueSliding WindowMonotonic Queue |
| 127. Word Ladder | Hard | 52.8% | TopicsHash TableStringBreadth-First SearchBidirectional Search |
| Split Array Largest Sum | Hard | 52.8% | TopicsArrayBinary SearchDynamic ProgrammingGreedyPrefix Sum |
| 2968. Apply Operations to Maximize Frequency Score | Hard | 52.8% | TopicsArrayBinary SearchSliding WindowSortingPrefix Sum |
| 3186. Maximum Total Damage With Spell Casting | Medium | 52.8% | TopicsArrayHash TableTwo PointersBinary SearchDynamic ProgrammingSortingCounting |
| Sliding Window Maximum | Hard | 52.8% | TopicsArrayQueueSliding WindowHeap (Priority Queue)Monotonic QueueRange Minimum/Maximum Query |
| Find Duplicate Subtrees | Medium | 52.8% | TopicsHash TableTreeDepth-First SearchBinary Tree |
| 55. Jump Game | Medium | 52.8% | TopicsArrayDynamic ProgrammingGreedy |
| First Missing Positive | Hard | 52.8% | TopicsArrayHash Table |
| Heaters | Medium | 52.8% | TopicsArrayTwo PointersBinary SearchSorting |
| Longest Consecutive Sequence | Medium | 52.8% | TopicsArrayHash TableUnion-Find |
| 53. Maximum Subarray | Medium | 52.8% | TopicsArrayDivide and ConquerDynamic Programming |
| 1657. Determine if Two Strings Are Close | Medium | 52.8% | TopicsHash TableStringSortingCounting |
| 2608. Shortest Cycle in a Graph | Hard | 52.8% | TopicsBreadth-First SearchGraph Theory |
| 1319. Number of Operations to Make Network Connected | Medium | 52.8% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 2484. Count Palindromic Subsequences | Hard | 52.8% | TopicsStringDynamic Programming |
| 3608. Minimum Time for K Connected Components | Medium | 52.8% | TopicsBinary SearchUnion-FindGraph TheorySorting |
| 2360. Longest Cycle in a Graph | Hard | 52.8% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological SortKosaraju's AlgorithmTarjan's SCC Algorithm |
| Freedom Trail | Hard | 52.8% | TopicsStringDynamic ProgrammingDepth-First SearchBreadth-First Search |
| 523. Continuous Subarray Sum | Medium | 52.8% | TopicsArrayHash TableMathPrefix SumPigeonhole Principle |
| 864. Shortest Path to Get All Keys | Hard | 52.8% | TopicsArrayBit ManipulationBreadth-First SearchMatrix |
| Remove Boxes | Hard | 52.8% | TopicsArrayDynamic ProgrammingMemoization |
| 10. Regular Expression Matching | Hard | 52.8% | TopicsStringDynamic ProgrammingRecursion |
| 542. 01 Matrix | Medium | 52.8% | TopicsArrayDynamic ProgrammingBreadth-First SearchMatrix |
| 322. Coin Change | Medium | 52.8% | TopicsArrayDynamic ProgrammingBreadth-First SearchKnapsack ProblemComplete Knapsack |
