Backtracking2 articles
Backtracking
Backtracking explores all candidates and prunes dead ends early. Classic for permutations, combinations, and constraint-satisfaction.
Backtracking Pattern — the undo-step that trips candidates
Backtracking isn't hard because recursion is hard. It's hard because candidates can't name the decision they're making at each level. Here's the one question that fixes that — and why the 'choose/explore/un-choose' template lies to you.
Fin · Apr 13, 2026
Recursion Interview Questions — base case first, or it eats you
A practical recursion interview prep guide for software engineers: the question families that repeat, the helper-contract mistakes that waste time, and the short drill plan that makes recursion rounds feel predictable.
Fin · Apr 10, 2026