2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 98. Validate Binary Search Tree | Medium | 36% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| 110. Balanced Binary Tree | Easy | 36% | TopicsTreeDepth-First SearchBinary Tree |
| Linked List Cycle II | Medium | 36% | TopicsHash TableLinked ListTwo PointersFloyd's Cycle Finding Algorithm |
| Implement Trie (Prefix Tree) | Medium | 36% | TopicsHash TableStringDesignTrie |
| 963. Minimum Area Rectangle II | Medium | 36% | TopicsArrayHash TableMathGeometry |
| 1091. Shortest Path in Binary Matrix | Medium | 36% | TopicsArrayBreadth-First SearchMatrix |
| 214. Shortest Palindrome | Hard | 35.5% | TopicsStringRolling HashString MatchingHash FunctionManacherZ AlgorithmKnuth–Morris–Pratt Algorithm |
| Exclusive Time of Functions | Medium | 35.5% | TopicsArrayStack |
| 2035. Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 35.5% | TopicsArrayTwo PointersBinary SearchDynamic ProgrammingBit ManipulationMeet in the MiddleSortingOrdered SetBitmask |
| Expression Add Operators | Hard | 35.5% | TopicsMathStringBacktracking |
| 421. Maximum XOR of Two Numbers in an Array | Medium | 35.5% | TopicsArrayHash TableBit ManipulationTrie |
| Employee Bonus | Easy | 35.5% | TopicsDatabase |
| 684. Redundant Connection | Medium | 35.5% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 792. Number of Matching Subsequences | Medium | 35.5% | TopicsArrayHash TableStringBinary SearchDynamic ProgrammingTrieSorting |
| 199. Binary Tree Right Side View | Medium | 35% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Group Shifted Strings | Medium | 35% | TopicsArrayHash TableString |
| 1672. Richest Customer Wealth | Easy | 35% | TopicsArrayMatrix |
| 237. Delete Node in a Linked List | Medium | 35% | TopicsLinked List |
| 258. Add Digits | Easy | 35% | TopicsMathSimulationNumber Theory |
| Range Sum Query - Immutable | Easy | 35% | TopicsArrayDesignPrefix Sum |
| 790. Domino and Tromino Tiling | Medium | 35% | TopicsDynamic Programming |
| 962. Maximum Width Ramp | Medium | 35% | TopicsArrayTwo PointersStackMonotonic Stack |
| 1021. Remove Outermost Parentheses | Easy | 35% | TopicsStringStackBracket Sequences |
| 3646. Next Special Palindrome Number | Hard | 35% | TopicsBacktrackingBit Manipulation |
| 2188. Minimum Time to Finish the Race | Hard | 34.4% | TopicsArrayDynamic Programming |
