The Backtracking is an algorithmic-technique to solve a problem by an incremental way. It uses recursive approach to solve the problems. We can say that the backtracking is used to find all possible combination to solve an optimization problem.
In this Section We are going to cover
- Hamiltonian Cycle
- M-Coloring Problem
- N Queen Problem
- Rat in Maze Problem
- Cryptarithmetic Puzzle
- Subset Sum Problem
- Sudoku Solving Algorithm
- Knight-Tour Problem
- Tug-Of-War Problem
- Word Break Algorithm
- Maximum number by swapping problem