Code & DSA

Use order to eliminate impossible candidates.

Reuse work across adjacent ranges.

Turn range calculations into subtraction.

Sort first, then reason about overlap.

Remember unresolved candidates.

Track ownership of every link before rewriting it.

Search a monotonic answer space.

Maintain only the candidates you need.

Share prefixes across strings.

Explore a branch while preserving traversal state.

Explore unweighted distance in layers.

Order work constrained by dependencies.

Explore choices and undo their effects.

Reuse solutions to repeated subproblems.

Prove a local decision preserves an optimal solution.