Find a lesson, question or project

Start typing to search published content and planned structures.

↑ ↓ moveEnter openEsc close

Choose a focused practice path

Compare all tracks

Published and available

Planned for later

Complexity and foundations

PlannedView outline Learn Big O, constraints, dry runs, invariants, and how to compare possible approaches.

Hashing and sliding windows

PlannedView outline Use fast lookups and controlled windows to remove repeated work.

Binary search

PlannedView outline Search sorted data, find boundaries, and binary search an answer space with a clear invariant.

Linked lists

PlannedView outline Reason about pointers, ownership, cycles, and local changes to a chain of nodes.

Stacks and queues

PlannedView outline Model ordering, deferred work, monotonic structures, and breadth first processing.

Heaps and priority queues

PlannedView outline Keep the next best candidate available without sorting everything repeatedly.

Greedy algorithms

PlannedView outline Recognize when the best local choice can safely lead to a global result.

Dynamic programming

PlannedView outline Turn repeated recursive work into explicit state, transitions, and reusable results.