Backtracking Algorithm Interview Questions

Backtracking is a powerful algorithmic technique used to solve problems by exploring all possible solutions in a systematic and recursive manner. It is particularly useful for problems that require searching through a vast solution space, such as combinatorial problems, constraint satisfaction problems, and optimization tasks.

Easy Problems

1. Rat in a Maze
2. Print all permutations
3. Palindromic Partitions
4. All possible paths in a matrix
5. Subset sum
6. Tug of war

Medium Problems

1. N Queens Problem
2. Word Break Problem
3. Path to middle cell in a maze
4. Hamiltonian cycle
5. Sudoku
6. M Coloring Problem
7. Cryptarithmetic puzzle
8. Path of more than k length
9. Partition into k subsets

Hard Problems

1. Warnsdorff's Algorithm
2. Remove Invalid Parenthesis
3. Match a pattern and string using regular expression
4. longest possible route in a matrix with hurdles
5. Shortest safe route in a path with landmines

Related Links:

• DSA Tutorial
• System Design Tutorial
• GfG 160