Backtracking Algorithms Improve Improve Improve Like Article Like Save Article Save Share Report issue Report Backtracking algorithms are like problem-solving strategies that help explore different options to find the best solution. They work by trying out different paths and if one doesn’t work, they backtrack and try another until they find the right one. It’s like solving a puzzle by testing different pieces until they fit together perfectly. Backtracking Table of Content What is Backtracking? What is Backtracking Algorithm? Types of Backtracking Algorithm When can be Backtracking Algorithm used? Introduction of Backtracking Algorithm Standard Problems on Backtracking Easy problems on Backtracking Medium problems on Backtracking Hard problems on Backtracking Introduction of Backtracking: Introduction to Backtracking – Data Structure and Algorithm Tutorials Difference between Backtracking and Branch-N-Bound technique What is the difference between Backtracking and Recursion? Standard Problems on Backtracking: The Knight’s tour problem Rat in a Maze N Queen Problem | Backtracking-3 Subset Sum problem m Coloring Problem Hamiltonian Cycle Sudoku | Backtracking-7 Magnet Puzzle Remove Invalid Parentheses A backtracking approach to generate n bit Gray Codes Write a program to print all permutations of a given string Easy problems on Backtracking: Backtracking to find all subsets Check if a given string is sum-string Count all possible paths between two vertices Find all distinct subsets of a given set Find if there is a path of more than k length from a source Print all paths from a given source to a destination Print all possible strings that can be made by placing spaces Medium problems on Backtracking: Tug of War 8 queen problem Combinational Sum Warnsdorff’s algorithm for Knight’s tour problem Find paths from corner cell to middle cell in maze Find Maximum number possible by doing at-most K swaps Rat in a Maze with multiple steps or jump allowed N Queen in O(n) space Hard problems on Backtracking: Power Set in Lexicographic order Word Break Problem using Backtracking Partition of a set into K subsets with equal sum Longest Possible Route in a Matrix with Hurdles Find shortest safe route in a path with landmines Print all palindromic partitions of a string Printing all solutions in N-Queen Problem Print all longest common sub-sequences in lexicographical order Quick Links : Learn Data Structure and Algorithms | DSA Tutorial Top 20 Backtracking Algorithm Interview Questions ‘Practice Problems’ on Backtracking ‘Quiz’ on Backtracking ‘Videos’ on Backtracking Last Updated : 22 Feb, 2024 Like Article Save Article Next Introduction to Backtracking - Data Structure and Algorithm Tutorials Share your thoughts in the comments Add Your Comment Please Login to comment...