# Backtracking

When they said ‘Two steps forward, one step back, they were talking about backtracking. In backtracking, we try out various outcomes possible for one configuration. Once we are done with one configuration we backtrack to explore other configurations. The last time when you got stuck on one of the optional questions in an exam and tried to attempt the other one, you were actually backtracking. Another well-known application of a backtracking problem is the permutations of an array.

## Top Problems related to Backtracking

Minimum Cost to Destination

Find Number Of Islands

Shortest Path in a Binary Matrix

Sudoku Solver

Print Permutations - String

Valid Sudoku

Word Break-1

Rat In a Maze All Paths

N Queens

Partial BST

Palindrome Partitioning

Convert Bst To The Greater Sum Tree

Maze with N doors and 1 Key

Partition to K equal sum subsets

Word Search - l

Permutations

BST to greater tree

K - Sum Path In A Binary Tree

Possible Balanced Strings

Print All Paths

Sudoku