Meta
1396 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2466. Count Ways To Build Good Strings | Medium | 11.9% | TopicsDynamic Programming |
| 3161. Block Placement Queries | Hard | 11.9% | TopicsArrayBinary SearchBinary Indexed TreeSegment TreeOrdered Set |
| 2185. Counting Words With a Given Prefix | Easy | 11.9% | TopicsArrayStringString Matching |
| 916. Word Subsets | Medium | 11.9% | TopicsArrayHash TableString |
| Mini Parser | Medium | 11.9% | TopicsStringStackDepth-First Search |
| 1462. Course Schedule IV | Medium | 11.9% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort |
| 1365. How Many Numbers Are Smaller Than the Current Number | Easy | 11.9% | TopicsArrayHash TableSortingCounting Sort |
| 2402. Meeting Rooms III | Hard | 11.9% | TopicsArrayHash TableSortingHeap (Priority Queue)Simulation |
| 3174. Clear Digits | Easy | 11.9% | TopicsStringStackSimulation |
| 1910. Remove All Occurrences of a Substring | Medium | 11.9% | TopicsStringStackSimulation |
| 3066. Minimum Operations to Exceed Threshold Value II | Medium | 11.9% | TopicsArrayHeap (Priority Queue)Simulation |
| 1632. Rank Transform of a Matrix | Hard | 11.9% | TopicsArrayUnion-FindGraph TheoryTopological SortSortingMatrix |
| 1079. Letter Tile Possibilities | Medium | 11.9% | TopicsHash TableStringBacktrackingCounting |
| 740. Delete and Earn | Medium | 11.9% | TopicsArrayHash TableDynamic Programming |
| 1415. The k-th Lexicographical String of All Happy Strings of Length n | Medium | 11.9% | TopicsStringBacktracking |
| Second Minimum Node In a Binary Tree | Easy | 11.9% | TopicsTreeDepth-First SearchBinary Tree |
| 2570. Merge Two 2D Arrays by Summing Values | Easy | 11.9% | TopicsArrayHash TableTwo Pointers |
| 1518. Water Bottles | Easy | 11.9% | TopicsMathSimulation |
| 1603. Design Parking System | Easy | 11.9% | TopicsDesignSimulationCounting |
| 2560. House Robber IV | Medium | 11.9% | TopicsArrayBinary SearchDynamic ProgrammingGreedy |
| 606. Construct String from Binary Tree | Medium | 11.9% | TopicsStringTreeDepth-First SearchBinary Tree |
| 847. Shortest Path Visiting All Nodes | Hard | 11.9% | TopicsDynamic ProgrammingBit ManipulationBreadth-First SearchGraph TheoryBitmask |
| Flatten Deeply Nested Array | Medium | 11.9% | Topics— |
| 841. Keys and Rooms | Medium | 11.9% | TopicsDepth-First SearchBreadth-First SearchGraph Theory |
| 838. Push Dominoes | Medium | 11.9% | TopicsTwo PointersStringDynamic Programming |
