2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 815. Bus Routes | Hard | 33.2% | TopicsArrayHash TableBreadth-First Search |
| 841. Keys and Rooms | Medium | 33.2% | TopicsDepth-First SearchBreadth-First SearchGraph Theory |
| 2332. The Latest Time to Catch a Bus | Medium | 33.2% | TopicsArrayTwo PointersBinary SearchSorting |
| Count and Say | Medium | 33.2% | TopicsString |
| Multiply Strings | Medium | 33.2% | TopicsMathStringSimulation |
| H-Index | Medium | 33.2% | TopicsArraySortingCounting Sort |
| Remove Duplicate Letters | Medium | 33.2% | TopicsStringStackGreedyMonotonic Stack |
| Find K Pairs with Smallest Sums | Medium | 33.2% | TopicsArrayHeap (Priority Queue) |
| Diagonal Traverse | Medium | 33.2% | TopicsArrayMatrixSimulation |
| Managers with at Least 5 Direct Reports | Medium | 33.2% | TopicsDatabase |
| 802. Find Eventual Safe States | Medium | 33.2% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological SortKosaraju's AlgorithmTarjan's SCC Algorithm |
| 987. Vertical Order Traversal of a Binary Tree | Hard | 33.2% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchSortingBinary Tree |
| Monthly Transactions I | Medium | 33.2% | TopicsDatabase |
| Students and Examinations | Easy | 33.2% | TopicsDatabase |
| Flatten Binary Tree to Linked List | Medium | 32.6% | TopicsLinked ListStackTreeDepth-First SearchBinary Tree |
| 377. Combination Sum IV | Medium | 32.6% | TopicsArrayDynamic Programming |
| Reverse String II | Easy | 32.6% | TopicsTwo PointersString |
| 692. Top K Frequent Words | Medium | 32.6% | TopicsArrayHash TableStringTrieSortingHeap (Priority Queue)Bucket SortCounting |
| 1254. Number of Closed Islands | Medium | 32.6% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 2115. Find All Possible Recipes from Given Supplies | Medium | 32.6% | TopicsArrayHash TableStringGraph TheoryTopological SortDirected Acyclic Graph |
| 2812. Find the Safest Path in a Grid | Medium | 32.6% | TopicsArrayBinary SearchBreadth-First SearchUnion-FindHeap (Priority Queue)Matrix |
| 115. Distinct Subsequences | Hard | 32.6% | TopicsStringDynamic Programming |
| Minimum Height Trees | Medium | 32.6% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort |
| Nth Digit | Medium | 32.6% | TopicsMathBinary Search |
| 451. Sort Characters By Frequency | Medium | 32.6% | TopicsHash TableStringSortingHeap (Priority Queue)Bucket SortCounting |
