Backtracking Problems
Backtracking explores all possible solutions by building candidates incrementally and abandoning those that fail constraints. Classic problems include N-Queens, Sudoku solver, and permutation generation.
18 problems
| Title | Difficulty | Platform |
|---|---|---|
| Beautiful Arrangement | Medium | LeetCode |
| Combinations | Medium | LeetCode |
| Find Maximum number possible by doing at-most K swaps | Hard | GeeksforGeeks |
| Find paths from corner cell to middle cell in maze | Hard | GeeksforGeeks |
| K-th Symbol in Grammar | Medium | LeetCode |
| M-Coloring Problem | Practice | Medium | GeeksforGeeks |
| N-Queens | Hard | LeetCode |
| Palindrome Partitioning | Medium | LeetCode |
| Partition of a set into K subsets with equal sum | Hard | GeeksforGeeks |
| Permutations II | Medium | LeetCode |
| Print all Palindromic Partitions of a String using Bit Manipulation | Hard | GeeksforGeeks |
| Solving Cryptarithmetic Puzzles | Hard | GeeksforGeeks |
| Subset Sum Problem | Medium | GeeksforGeeks |
| Subsets II | Medium | LeetCode |
| Sudoku Solver | Hard | LeetCode |
| Tug of War | Hard | GeeksforGeeks |
| Unique Paths III | Hard | LeetCode |
| Word Search II | Hard | LeetCode |