TOPIC
BACKTRACKING
Every backtracking problem in the series, in the order the worlds teach them.
17 STAGES
MEDIUM1:37Subsets
LC 78▶ START
MEDIUM1:40Subsets II
LC 90▶ START
MEDIUM1:42Combinations
LC 77▶ START
MEDIUM1:39Generate Parentheses
LC 22▶ START
MEDIUM1:40Letter Combinations
LC 17▶ START
MEDIUM1:36Permutations
LC 46▶ START
MEDIUM1:44Permutations II
LC 47▶ START
MEDIUM1:42Combination Sum
LC 39▶ START
MEDIUM1:52Combination Sum II
LC 40▶ START
MEDIUM1:35Combination Sum III
LC 216▶ START
MEDIUM1:39Partition to K Equal Sum Subsets
LC 698▶ START
MEDIUM1:45Palindrome Partitioning
LC 131▶ START
MEDIUM1:41Restore IP Addresses
LC 93▶ START
MEDIUM1:43Word Search
LC 79▶ START
HARD1:40N-Queens
LC 51▶ START
HARD1:36N-Queens II
LC 52▶ START
HARD1:41Sudoku Solver
LC 37▶ START
More topics
- Dynamic programming 19
- Greedy 17
- Tree recursion 13
- Bit manipulation 8
- Design 8
- Two pointers 8
- Hash map 7
- Heap 7
- Binary search 6
- Breadth-first search 5
- Linked list 5
- Fast and slow pointers 4
- Grid search 4
- Shortest path 4
- Depth-first search 3
- Math 3
- Carry 2
- Hash set 2
- Matrix 2
- Monotonic stack 2
- Prefix sums 2
- Sliding window 2
- Stack 2
- Topological sort 2
- Trie 2