Loading repovive.com/roadmaps/leetcode-hard-problem-solving
Roadmaps
LeetCode Hard Problem Solving
Premium
Backtracking
Problemset
Discussion
AI Helper
Getting Started
0/5
Binary Search
0/49
Backtracking
0/48
1
Introduction to Hard Backtracking
2
When to Use Backtracking
3
Problem - N-Queens
4
N-Queens - Why Naive Fails
5
N-Queens - Constraint Tracking
6
N-Queens - Implementation
7
N-Queens - Time and Space
8
Problem - Sudoku Solver
9
Sudoku Solver - Constraint Representation
10
Sudoku Solver - Implementation
11
Sudoku Solver - Time and Space
12
Problem - Word Search II
13
Word Search II - Why Naive Fails
14
Word Search II - Trie Structure
15
Word Search II - Implementation
16
Word Search II - Time and Space
17
Problem - Regular Expression Matching
18
Regular Expression Matching - Why It's Hard
19
Regular Expression Matching - Recursive Structure
20
Regular Expression Matching - Implementation
21
Regular Expression Matching - Time and Space
22
Problem - Expression Add Operators
23
Expression Add Operators - Handling Precedence
24
Expression Add Operators - Implementation
25
Expression Add Operators - Time and Space
26
Problem - Remove Invalid Parentheses
27
Remove Invalid Parentheses - Counting Removals
28
Remove Invalid Parentheses - Implementation
29
Remove Invalid Parentheses - Time and Space
30
Problem - Word Break II
31
Word Break II - Why Naive Fails
32
Word Break II - Implementation
33
Word Break II - Time and Space
34
Problem - Word Ladder II
35
Word Ladder II - Two-Phase Approach
36
Word Ladder II - Implementation
37
Word Ladder II - Time and Space
38
Problem - Partition to K Equal Sum Subsets
39
Partition to K Equal Sum Subsets - Pruning Strategies
40
Partition to K Equal Sum Subsets - Implementation
41
Partition to K Equal Sum Subsets - Time and Space
42
Problem - Unique Paths III
43
Unique Paths III - Counting Cells
44
Unique Paths III - Implementation
45
Unique Paths III - Time and Space
46
Quiz: Backtracking Patterns
47
Common Mistakes in Backtracking
48
Section Recap
Greedy
0/45
Monotonic Stack
0/45
Hashmap
0/45
3.1
Introduction to Hard Backtracking
100%
Premium Roadmap
You're previewing free content. Unlock all units to continue learning.
Subscribe
Tasks
Read Unit