2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 704. Binary Search | Easy | 52.3% | TopicsArrayBinary Search |
| Sqrt(x) | Easy | 52.2% | TopicsMathBinary SearchNewton's Method |
| 78. Subsets | Medium | 52.2% | TopicsArrayBacktrackingBit Manipulation |
| 125. Valid Palindrome | Easy | 52.2% | TopicsTwo PointersString |
| 300. Longest Increasing Subsequence | Medium | 52.2% | TopicsArrayBinary SearchDynamic ProgrammingLongest Increasing Subsequence |
| 904. Fruit Into Baskets | Medium | 51.6% | TopicsArrayHash TableSliding Window |
| 207. Course Schedule | Medium | 51.4% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| 10. Regular Expression Matching | Hard | 51.2% | TopicsStringDynamic ProgrammingRecursion |
| Logger Rate Limiter | Easy | 51.1% | TopicsHash TableDesignData Stream |
| 994. Rotting Oranges | Medium | 51.1% | TopicsArrayBreadth-First SearchMatrix |
| 152. Maximum Product Subarray | Medium | 50.9% | TopicsArrayDynamic Programming |
| Maximal Square | Medium | 50.9% | TopicsArrayDynamic ProgrammingMatrix |
| 3Sum Closest | Medium | 50.7% | TopicsArrayTwo PointersSorting |
| Maximal Rectangle | Hard | 50.7% | TopicsArrayDynamic ProgrammingStackMatrixMonotonic Stack |
| 349. Intersection of Two Arrays | Easy | 50.7% | TopicsArrayHash TableTwo PointersBinary SearchSorting |
| 295. Find Median from Data Stream | Hard | 50.5% | TopicsTwo PointersDesignSortingHeap (Priority Queue)Data Stream |
| 73. Set Matrix Zeroes | Medium | 50.5% | TopicsArrayHash TableMatrix |
| 155. Min Stack | Medium | 50.5% | TopicsStackDesign |
| 19. Remove Nth Node From End of List | Medium | 49.9% | TopicsLinked ListTwo Pointers |
| Two Sum II - Input Array Is Sorted | Medium | 49.9% | TopicsArrayTwo PointersBinary Search |
| Basic Calculator | Hard | 49.4% | TopicsMathStringStackRecursion |
| 234. Palindrome Linked List | Easy | 49.4% | TopicsLinked ListTwo PointersStackRecursion |
| 23. Merge k Sorted Lists | Hard | 49.2% | TopicsLinked ListDivide and ConquerHeap (Priority Queue)Merge SortTournament Sort |
| 46. Permutations | Medium | 49.2% | TopicsArrayBacktracking |
| 62. Unique Paths | Medium | 49% | TopicsMathDynamic ProgrammingCombinatorics |
