Path Finding with Backtracking Problems
11 Path Finding with Backtracking problems on LeetCode, a Backtracking interview pattern, ranked by importance (how often it comes up in real interviews). Difficulty (ELO) and importance shown per problem.
| # | PROBLEM | DIFF | ELO | IMP | PATTERNS |
|---|---|---|---|---|---|
| 1 | Word Search | Medium | 1457 | 87 | Matrix Traversal (Diagonal, Valid Sudoku, etc) |
| 2 | Path with Maximum Gold | Medium | 1663 | 68 | Matrix Traversal (Diagonal, Valid Sudoku, etc) |
| 3 | All Paths From Source to Target | Easy | 1383 | 62 | DFS Path Finding |
| 4 | Robot Room CleanerPREMIUM | Hard | 2087 | 53 | DFS Connected Components |
| 5 | Unique Paths III | Hard | 1830 | 52 | Bitmask DP |
MORE BACKTRACKING PATTERNS
// your mastery





What's your Path Finding with Backtracking tier?
leaps.gg syncs your LeetCode history, scores your Path Finding with Backtracking mastery, and recommends exactly which problems to do next with spaced repetition. Free to start.
GET MY MASTERY MAP →