2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 213. House Robber II | Medium | 37% | TopicsArrayDynamic Programming |
| Sum of Two Integers | Medium | 37% | TopicsMathBit Manipulation |
| Assign Cookies | Easy | 37% | TopicsArrayTwo PointersGreedySortingQuicksort |
| Predict the Winner | Medium | 37% | TopicsArrayMathDynamic ProgrammingRecursionMinimaxGame TheoryZero-Sum Game |
| 542. 01 Matrix | Medium | 37% | TopicsArrayDynamic ProgrammingBreadth-First SearchMatrix |
| Accounts Merge | Medium | 37% | TopicsArrayHash TableStringDepth-First SearchBreadth-First SearchUnion-FindSorting |
| Asteroid Collision | Medium | 37% | TopicsArrayStackSimulation |
| 1110. Delete Nodes And Return Forest | Medium | 37% | TopicsArrayHash TableTreeDepth-First SearchBinary Tree |
| 1277. Count Square Submatrices with All Ones | Medium | 37% | TopicsArrayDynamic ProgrammingMatrix |
| 1470. Shuffle the Array | Easy | 37% | TopicsArray |
| Average Time of Process per Machine | Easy | 37% | TopicsDatabase |
| 1825. Finding MK Average | Hard | 37% | TopicsDesignQueueHeap (Priority Queue)Data StreamOrdered SetTreap |
| Minimum Path Sum | Medium | 36.5% | TopicsArrayDynamic ProgrammingMatrix |
| 1526. Minimum Number of Increments on Subarrays to Form a Target Array | Hard | 36.5% | TopicsArrayDynamic ProgrammingStackGreedyMonotonic Stack |
| 2663. Lexicographically Smallest Beautiful String | Hard | 36.5% | TopicsStringGreedy |
| Counter | Easy | 36.5% | Topics— |
| Permutation Sequence | Hard | 36.5% | TopicsMathRecursion |
| Simplify Path | Medium | 36.5% | TopicsStringStack |
| Evaluate Reverse Polish Notation | Medium | 36.5% | TopicsArrayMathStack |
| 2149. Rearrange Array Elements by Sign | Medium | 36.5% | TopicsArrayTwo PointersSimulation |
| 228. Summary Ranges | Easy | 36.5% | TopicsArray |
| LFU Cache | Hard | 36.5% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| Number of Islands II | Hard | 36% | TopicsArrayHash TableUnion-Find |
| Evaluate Division | Medium | 36% | TopicsArrayStringDepth-First SearchBreadth-First SearchUnion-FindGraph TheoryShortest PathBellman–Ford AlgorithmFloyd–Warshall Algorithm |
| 787. Cheapest Flights Within K Stops | Medium | 36% | TopicsDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)Shortest Path |
