2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Substring with Concatenation of All Words | Hard | 34.4% | TopicsHash TableStringSliding Window |
| Implement Queue using Stacks | Easy | 34.4% | TopicsStackDesignQueue |
| Alien Dictionary | Hard | 34.4% | TopicsArrayStringDepth-First SearchBreadth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| 767. Reorganize String | Medium | 34.4% | TopicsHash TableStringGreedySortingHeap (Priority Queue)Counting |
| Average Selling Price | Easy | 34.4% | TopicsDatabase |
| 212. Word Search II | Hard | 33.8% | TopicsArrayStringBacktrackingTrieMatrix |
| 332. Reconstruct Itinerary | Hard | 33.8% | TopicsArrayStringDepth-First SearchGraph TheorySortingHeap (Priority Queue)Eulerian CircuitEulerian PathSemi-Eulerian Graph |
| 581. Shortest Unsorted Continuous Subarray | Medium | 33.8% | TopicsArrayTwo PointersStackGreedySortingMonotonic Stack |
| 713. Subarray Product Less Than K | Medium | 33.8% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
| 975. Odd Even Jump | Hard | 33.8% | TopicsArrayDynamic ProgrammingStackSortingMonotonic StackOrdered Set |
| 24. Swap Nodes in Pairs | Medium | 33.8% | TopicsLinked ListRecursion |
| 40. Combination Sum II | Medium | 33.8% | TopicsArrayBacktracking |
| Convert Sorted Array to Binary Search Tree | Easy | 33.8% | TopicsArrayDivide and ConquerTreeBinary Search TreeBinary Tree |
| Triangle | Medium | 33.8% | TopicsArrayDynamic Programming |
| Design Hit Counter | Medium | 33.8% | TopicsArrayBinary SearchDesignQueueData Stream |
| 435. Non-overlapping Intervals | Medium | 33.8% | TopicsArrayDynamic ProgrammingGreedySorting |
| Repeated Substring Pattern | Easy | 33.8% | TopicsStringString MatchingZ AlgorithmKnuth–Morris–Pratt Algorithm |
| 844. Backspace String Compare | Easy | 33.8% | TopicsTwo PointersStringStackSimulation |
| 974. Subarray Sums Divisible by K | Medium | 33.8% | TopicsArrayHash TablePrefix Sum |
| 1293. Shortest Path in a Grid with Obstacles Elimination | Hard | 33.8% | TopicsArrayBreadth-First SearchMatrix |
| 724. Find Pivot Index | Easy | 33.8% | TopicsArrayPrefix Sum |
| 3532. Path Existence Queries in a Graph I | Medium | 33.8% | TopicsArrayHash TableBinary SearchUnion-FindGraph Theory |
| 77. Combinations | Medium | 33.2% | TopicsBacktracking |
| Count of Smaller Numbers After Self | Hard | 33.2% | TopicsArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered SetTreap |
| 746. Min Cost Climbing Stairs | Easy | 33.2% | TopicsArrayDynamic Programming |
