Question 1

What is backtracking?

Accepted Answer

Backtracking is a general algorithmic technique for solving problems recursively by trying to build a solution incrementally. When it's determined that a solution cannot be completed from the current state, the algorithm 'backtracks' to a previous state and tries a different path.

Question 2

What are some common backtracking problems?

Accepted Answer

Common backtracking problems include the N-Queens problem, Sudoku solvers, generating permutations and combinations, and finding paths in a maze or grid.

Backtracking Algorithms Coding Interview Preparation

Related Algorithm Guides