2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2996. Smallest Missing Integer Greater Than Sequential Prefix Sum | Easy | 21% | TopicsArrayHash TableSorting |
| 3686. Number of Stable Subsequences | Hard | 21% | TopicsArrayDynamic Programming |
| 3650. Minimum Cost Path with Edge Reversals | Medium | 21% | TopicsGraph TheoryHeap (Priority Queue)Shortest Path |
| Scramble String | Hard | 19.7% | TopicsStringDynamic Programming |
| Insertion Sort List | Medium | 19.7% | TopicsLinked ListSorting |
| Read N Characters Given read4 II - Call Multiple Times | Hard | 19.7% | TopicsArraySimulationInteractive |
| Longest Substring with At Most Two Distinct Characters | Medium | 19.7% | TopicsHash TableStringSliding Window |
| Paint Fence | Medium | 19.7% | TopicsDynamic Programming |
| Wiggle Sort | Medium | 19.7% | TopicsArrayGreedySorting |
| Design Snake Game | Medium | 19.7% | TopicsArrayHash TableDesignQueueSimulation |
| Line Reflection | Medium | 19.7% | TopicsArrayHash TableMath |
| Rearrange String k Distance Apart | Hard | 19.7% | TopicsHash TableStringGreedySortingHeap (Priority Queue)Counting |
| Range Addition | Medium | 19.7% | TopicsArrayPrefix Sum |
| 452. Minimum Number of Arrows to Burst Balloons | Medium | 19.7% | TopicsArrayGreedySorting |
| Smallest Good Base | Hard | 19.7% | TopicsMathBinary Search |
| The Maze II | Medium | 19.7% | TopicsArrayDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)MatrixShortest PathDijkstra's AlgorithmHeuristic SearchA* Search |
| Freedom Trail | Hard | 19.7% | TopicsStringDynamic ProgrammingDepth-First SearchBreadth-First Search |
| Output Contest Matches | Medium | 19.7% | TopicsStringRecursionSimulation |
| Longest Line of Consecutive One in Matrix | Medium | 19.7% | TopicsArrayDynamic ProgrammingMatrix |
| Design Compressed String Iterator | Easy | 19.7% | TopicsArrayStringDesignIterator |
| Shopping Offers | Medium | 19.7% | TopicsArrayDynamic ProgrammingBacktrackingBit ManipulationMemoizationBitmaskKnapsack ProblemComplete Knapsack |
| Number of Longest Increasing Subsequence | Medium | 19.7% | TopicsArrayDynamic ProgrammingBinary Indexed TreeSegment TreeLongest Increasing Subsequence |
| 682. Baseball Game | Easy | 19.7% | TopicsArrayStackSimulation |
| K Empty Slots | Hard | 19.7% | TopicsArrayBinary Indexed TreeSegment TreeQueueSliding WindowHeap (Priority Queue)Ordered SetMonotonic Queue |
| 698. Partition to K Equal Sum Subsets | Medium | 19.7% | TopicsArrayDynamic ProgrammingBacktrackingBit ManipulationMemoizationBitmask |
