# Data Structures Algorithms
All Data Structures Algorithms notes →1 — Backtracking
The choose-explore-unchoose template and pruning strategies that make exhaustive search tractable.
data-structures-algorithms backtracking book
2 — N Queens
Placing N non-attacking queens via backtracking with row/column/diagonal constraint tracking.
data-structures-algorithms backtracking book
3 — Sudoku Solver
Constraint-propagation backtracking over a 9×9 grid with row/column/box validity checks.
data-structures-algorithms backtracking book
4 — Permutations
Generating all orderings of a set via backtracking, including the handling of duplicate elements.
data-structures-algorithms backtracking book
5 — Combinations
Generating all fixed-size subsets via backtracking, and its relation to subset/power-set generation.
data-structures-algorithms backtracking book
6 — Branch & Bound
Backtracking augmented with a bounding function to prune branches that can't beat the best solution found so far.
data-structures-algorithms backtracking book