Backtracking

Every backtracking problem is the same skeleton: make a choice, recurse, undo the choice. Subsets, permutations, combinations, N-Queens, word search — identical shape, different constraints. The three variants: start index (combinations, avoid reuse), used array (permutations), and in-place marking (grids). Master the template and these become mechanical.