The Curriculum

Count the work before you write the code.

Trade memory for speed.

Let structure kill the inner loop.

Don't recompute the window — repair it.

Order of arrival is data too.

Halve the world until the answer is cornered.

Rewire pointers — never lose the chain.

Trust the recursion — it already solved the subtree.

Pick the walk that matches the question.

Always know the extreme — without sorting everything.

Sort once, sweep once — chaos becomes a timeline.

Try it, undo it, try the next thing.

Everything is a node; everything else is an edge.

Pay per character, search by prefix.

Take the best move now — and prove you can.

Stop re-solving the past.

One sentence, two indices.