onenoughtone
Practice Problems
Reinforce Your Learning
Practice these backtracking problems to strengthen your understanding of backtracking concepts.
Difficulty Levels:
EasyMediumHard
Filter by Difficulty:
Problem of the Day
N-Queens
HardPlace N queens on an N×N chessboard so that no two queens threaten each other.
Input: Example input
Output: Example output
All Problems
N-Queens
Backtracking, Board Configuration
Sudoku Solver
Backtracking, Constraint Satisfaction
Word Search
Backtracking, DFS, Matrix
Combination Sum
Backtracking, Combinatorial
Permutations
Backtracking, Combinatorial
Subsets
Backtracking, Combinatorial
Palindrome Partitioning
Backtracking, String
Letter Combinations of a Phone Number
Backtracking, String
Generate Parentheses
Backtracking, String
Rat in a Maze
Backtracking, Matrix
Practice Makes Perfect
Solidify your understanding of backtracking by solving these carefully selected problems.
Backtracking Problems
Filter by Difficulty:
Filter by Difficulty:
N-Queens
Backtracking, Board Configuration
Sudoku Solver
Backtracking, Constraint Satisfaction
Word Search
Backtracking, DFS, Matrix
Combination Sum
Backtracking, Combinatorial
Permutations
Backtracking, Combinatorial
Subsets
Backtracking, Combinatorial
Palindrome Partitioning
Backtracking, String
Letter Combinations of a Phone Number
Backtracking, String
Generate Parentheses
Backtracking, String
Rat in a Maze
Backtracking, Matrix
Problem of the Day
Problem of the Day
N-Queens
HardPlace N queens on an N×N chessboard so that no two queens threaten each other.
Input: Example input
Output: Example output
Your Progress
Your Progress
Complete your first problem to start tracking progress
Easy
0/1
Medium
0/8
Hard
0/1
Total
0/10
Next Steps
After practicing backtracking problems, explore these related topics: