Paths

Start here. How data sits in memory, and why that makes some operations instant and others slow.

The handful of moves behind most array and string problems. Learn to spot which one a problem wants.

Think recursively, then walk branching structures: trees, heaps, tries and graphs.

When brute force is too slow: make the safe greedy choice, or remember answers to smaller problems.