2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1838. Frequency of the Most Frequent Element | Medium | 38.8% | TopicsArrayBinary SearchGreedySliding WindowSortingPrefix Sum |
| 2965. Find Missing and Repeated Values | Easy | 38.8% | TopicsArrayHash TableMathMatrix |
| 138. Copy List with Random Pointer | Medium | 38.4% | TopicsHash TableLinked List |
| Largest Divisible Subset | Medium | 38.4% | TopicsArrayMathDynamic ProgrammingSorting |
| Add Strings | Easy | 38.4% | TopicsMathStringSimulation |
| 103. Binary Tree Zigzag Level Order Traversal | Medium | 38.4% | TopicsTreeBreadth-First SearchBinary Tree |
| Coin Change II | Medium | 38.4% | TopicsArrayDynamic ProgrammingKnapsack ProblemComplete Knapsack |
| Trapping Rain Water II | Hard | 37.9% | TopicsArrayBreadth-First SearchHeap (Priority Queue)Matrix |
| 680. Valid Palindrome II | Easy | 37.9% | TopicsTwo PointersStringGreedy |
| 105. Construct Binary Tree from Preorder and Inorder Traversal | Medium | 37.9% | TopicsArrayHash TableDivide and ConquerTreeBinary Tree |
| Intersection of Two Linked Lists | Easy | 37.9% | TopicsHash TableLinked ListTwo Pointers |
| 329. Longest Increasing Path in a Matrix | Hard | 37.9% | TopicsArrayDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryTopological SortMemoizationMatrixDirected Acyclic Graph |
| Find K Closest Elements | Medium | 37.9% | TopicsArrayTwo PointersBinary SearchSliding WindowSortingHeap (Priority Queue) |
| 901. Online Stock Span | Medium | 37.9% | TopicsStackDesignMonotonic StackData Stream |
| 1539. Kth Missing Positive Number | Easy | 37.9% | TopicsArrayBinary Search |
| 1631. Path With Minimum Effort | Medium | 37.9% | TopicsArrayBinary SearchDepth-First SearchBreadth-First SearchUnion-FindHeap (Priority Queue)MatrixDijkstra's Algorithm |
| 225. Implement Stack using Queues | Easy | 37.5% | TopicsStackDesignQueue |
| 743. Network Delay Time | Medium | 37.5% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)Shortest PathDijkstra's Algorithm |
| Search in Rotated Sorted Array II | Medium | 37.5% | TopicsArrayBinary Search |
| 297. Serialize and Deserialize Binary Tree | Hard | 37.5% | TopicsStringTreeDepth-First SearchBreadth-First SearchDesignBinary Tree |
| Find All Duplicates in an Array | Medium | 37.5% | TopicsArrayHash TableSorting |
| 525. Contiguous Array | Medium | 37.5% | TopicsArrayHash TablePrefix Sum |
| 645. Set Mismatch | Easy | 37% | TopicsArrayHash TableBit ManipulationSorting |
| 930. Binary Subarrays With Sum | Medium | 37% | TopicsArrayHash TableSliding WindowPrefix Sum |
| 210. Course Schedule II | Medium | 37% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort |
