Backtracking interview questions

Backtracking algorithms

What is backtracking? Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and ...
Read More

Combination sum problem

Combination sum problem Given an array of integers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target. Also, the same candidate can occur ...
Read More

Backtracking : Eight Queens problem

Backtracking : Eight Queens problem Given N x N chessboard, find a way to place N queens such that none of the queen can attack other. A queen can move ...
Read More