Loading Thita. Almost there...
Pattern 12 of 15
Master backtracking algorithms including subsets, permutations, combinations, N-Queens, and word search. Exhaustive search with pruning for constraint satisfaction.
7
105 min
Search for words in grid using backtracking. Handle visited cells and path restoration.
Solve N-Queens and Sudoku using backtracking with constraint propagation.
Generate all permutations using backtracking. Handle duplicates and next permutation.
Partition string into palindromic substrings using backtracking.
Find combinations that sum to target using backtracking. Handle reuse and duplicates.
Generate all subsets using include/exclude decision pattern. Handle duplicates in subsets.
Generate all valid parentheses combinations using backtracking with balance tracking.
Access theory, code examples, and practice problems.
Open DSA Learning Path