Browse Categories
Choose your Categories to read
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.
M-coloring Problem
By vaishnavi pandey
● Published At Oct 2021
In this article, we'll discuss one of the basic problems of graph theory i.e. m-coloring problem. ... Keep reading ..
Print all possible permutations of a given array without duplicates
By Vaibhav Agarwal
● Published At Dec 2021
In this article, we will discuss the problem of printing all possible permutations of a given array without duplicates. ... Keep reading ..
Top Problems related to Backtracking
Minimum Cost to Destination
Find Number Of Islands
Shortest Path in a Binary Matrix
Sudoku Solver
Print Permutations - String
Sudoku?
Word Break-1
Rat In a Maze All Paths
N Queens
Validate 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
K - Sum Path In A Binary Tree
Possible Balanced Strings
Print All Paths
The N - Queens Puzzle
Paths in a Maze
