Algorithms you play.
Classic algorithms rebuilt as little games. You drive the problem and lose to your own instincts, then meet the algorithm that never does — watch it work, predict its moves, and try to break it. The theory, pseudocode, a worked trace and a quiz come after, once it's already clicked.
Algorithms, played — frequently asked questions
What makes these algorithm lessons different?
Instead of watching an animation, you play the algorithm. Each lesson is a small game: you first solve the problem by instinct and (usually) lose, then meet the algorithm as a character who solves what you couldn't, then predict its moves, then try to break it. The full theory, pseudocode, complexity, a worked trace and a quiz come after — so the formal version reads like subtitles to something you've already felt.
Are the algorithm lessons free?
Yes. Every lesson is free, self-contained, and runs in your browser with no sign-up. They are keyboard-playable and include a text version of each diagram for screen readers.
Do these help with coding interviews?
Yes. Data structures and algorithms are half of every technical loop (system design is the other half). These lessons build durable intuition for how and why each algorithm works — the understanding that survives interview pressure — rather than memorized templates.
Which algorithm should I start with?
Start with Dijkstra: The Last Mile. Shortest-path search is the foundation for pathfinding, routing and many graph problems, and the game makes the priority-queue intuition click before you ever read the code.