INVARIANT
WATCH IT RUN · THEN RUN IT FROM MEMORY
37 DECKS · 37 LIVE · STEP 01 → 18

Watch it run.Then run it from memory.

Every algorithm animates one step at a time — then asks you to predict the next step before it shows you. Solve it, rate it, and it comes back on a spaced schedule.

BFS · —
01

Learn the Basics

Call-stack ladder + constraint ladder
What it covers
The operations budget · digit arithmetic · the √n bound · Euclid · recursion's two obligations · counting
5units6benches34slides
12 PROBLEMS · OPEN →
02

Sorting Techniques

Bar-array animator
What it covers
Selection · bubble · insertion · merge · quick · heap · counting · radix · shell
9units12benches63slides
10 PROBLEMS · OPEN →
03

Arrays · Easy + Medium

Array track + index cursors
What it covers
Write pointer · XOR · hashing · Dutch flag · voting · Kadane · matrices · prefix sums
14units15benches73slides
18 PROBLEMS · OPEN →
03

Arrays · Hard

Array track + index cursors
What it covers
k-Sum · voting at n/3 · merge-counting · interval sweep · max product
8units8benches52slides
8 PROBLEMS · OPEN →
3+

Hashing & Prefix Sums

Hash buckets, prefix arrays · twelve benches
What it covers
Hash-set buckets · canonical keys · counting, then bucketing by count · prefix sums · left and right products · the earliest prefix · counting matching prefixes by sum, XOR and remainder · difference arrays · 2D prefix sums · the array as its own hash table
10units12benches51slides
15 PROBLEMS · OPEN →
3+

Two Pointers

Pointers from both ends, bars, two streams · ten benches
What it covers
Converging on a sorted array · counting pairs inside a loop · filling from the ends · moving the shorter wall · pairing the ends after a sort · swapping from both ends · two sorted streams · a stalled stream · a write pointer with a rule · two running maxima
10units10benches49slides
15 PROBLEMS · OPEN →
04

Binary Search · On the Array

lo/mid/hi collapse
What it covers
invariant · lower/upper bound · first-last · rotated · find-min · peak · 2D matrix … & more
10units10benches63slides
11 PROBLEMS · OPEN →
04

Binary Search · On the Answer

lo/mid/hi collapse
What it covers
sqrt · koko · bouquets · divisor · ship · kth-missing · split · median
8units8benches52slides
8 PROBLEMS · OPEN →
05

Strings

Char track + frequency panel
What it covers
parsing · two-pointer palindromes · frequency · words · mapping … & more
5units5benches36slides
15 PROBLEMS · OPEN →
06

Linked List · Fundamentals

Node boxes, re-routing arrows
What it covers
node & pointer · traverse · insert/delete · doubly · reverse DLL
4units5benches28slides
1 PROBLEMS · OPEN →
06

Linked List · Medium

Node boxes, re-routing arrows
What it covers
middle · reverse · Floyd cycle · palindrome · remove Nth · intersection · add two
10units10benches52slides
10 PROBLEMS · OPEN →
06

Linked List · Hard + Mediums

Node boxes, re-routing arrows
What it covers
merge two/k · sort list · reverse k-group · rotate · copy random · LRU
7units7benches40slides
7 PROBLEMS · OPEN →
07

Recursion · Fundamentals + Backtracking

Recursion tree + call stack
What it covers
Fast power · subsets · combination sum · permutations
5units5benches47slides
11 PROBLEMS · OPEN →
07

Recursion · Hard Backtracking

Recursion tree + call stack
What it covers
Palindrome partition · word search · N-Queens · Sudoku
5units5benches31slides
5 PROBLEMS · OPEN →
08

Bit Manipulation

32-cell bit strip
What it covers
Read/set/clear/toggle · Kernighan count · bitmask power set · XOR family · divide by shifts · sieve · fast pow
11units12benches64slides
16 PROBLEMS · OPEN →
8+

Maths & Modular Arithmetic

Numbers laid out as grids, multiples lit · twelve benches
What it covers
A carry from the right · a base with no zero · a remainder that comes back · a direction reduced by the gcd · a divisor counting its multiples · the sieve from each prime's square · smallest prime factors · blocks of equal quotients · the fives in n! · square and multiply · Fermat's cut mod P − 1 · factorials and their inverses
12units12benches54slides
15 PROBLEMS · OPEN →
09

Stacks & Queues

Stack column, ring buffer · twelve benches
What it covers
Matching brackets · cancelling with the top · a stack of indices · a min stack · postfix evaluation · precedence · nested frames · a ring buffer · each structure built from the other
9units12benches49slides
15 PROBLEMS · OPEN →
9+

Monotonic Stack & Deque

Stacks beside bars, a two-ended deque · ten benches
What it covers
Next greater by index · a second lap round the circle · spans handed over on a pop · collisions at the top · car fleets · digits kept rising · each element's share of every subarray · the largest rectangle · the sliding window maximum · a deque on prefix sums
9units10benches50slides
15 PROBLEMS · OPEN →
10

Sliding Window & Two Pointer

Dual pointers + window shade
What it covers
Four templates · constant window · longest variable window · atMost(k) counting · shortest covering window
13units14benches64slides
12 PROBLEMS · OPEN →
11

Heaps

A heap drawn as its tree beside its array · eleven benches
What it covers
Sift up and sift down · heapify in O(n) and heap sort · keeping the k best · a comparison with a tie-break · the letter with most left first · a cooldown queue beside the heap · the smallest card starts a run · two heaps for a running median · one head per sorted list · trading a ladder back for bricks
10units11benches50slides
15 PROBLEMS · OPEN →
12

Greedy Algorithms

The choice and the one number it carries forward · twelve benches
What it covers
Spending the less useful bill · leaving room on the right · reach and levels of reach · a dry tank moves the start · cutting at the last occurrence · a range of open counts · one pass per neighbour · a stack where a letter that comes back waits · the order a swap proves · meeting at the median · every sum up to reach
11units12benches52slides
15 PROBLEMS · OPEN →
12+

Intervals & Sweep

Intervals as runs on a line, heaps of ends · twelve benches
What it covers
Copy, merge, copy · keeping the interval that ends first · an arrow at the first end · two pointers over two sorted lists · a +1 and a −1 per interval · a heap of departures · free rooms and busy rooms · a difference array · only the neighbours can clash · attending the event that ends first · a dp over the ends · the tallest building still standing
11units12benches50slides
15 PROBLEMS · OPEN →
13

Binary Trees · Representation & Traversals

SVG tree + traversal numbering
What it covers
Node/pointers · pre/in/postorder · level-order BFS … & more
12units12benches35slides
4 PROBLEMS · OPEN →
13

Binary Trees · Properties, Views & Paths

SVG tree + traversal numbering
What it covers
Bottom-up postorder (depth · diameter · max path sum) · same/symmetric/subtree · level views (zig-zag, right, vertical, width) · root-to-leaf paths, good nodes, zigzag · LCA · distance-K · infection time
17units19benches75slides
24 PROBLEMS · OPEN →
13

Binary Trees · Construction & Tree DP

SVG tree + traversal numbering
What it covers
Count complete O(log²n) · flatten O(1) · reconstruct from pre+in / in+post · serialize · Morris · tree DP (House Robber III, Cameras)
8units8benches32slides
7 PROBLEMS · OPEN →
14

Binary Search Trees

Search path + restructure
What it covers
The invariant over subtrees · search, min and max · ceil & floor · insert · delete's three cases · kth smallest · validate with a window · LCA · build from preorder · successor · the pausable iterator · merge · two-sum · recover · largest BST subtree
16units17benches95slides
18 PROBLEMS · OPEN →
14+

General Trees

Edge list to rooted tree · nine benches
What it covers
n − 1 edges to adjacency lists · DFS with a parent · subtree sizes · diameter with any number of children · peeling leaves to the centre · take-or-skip tree DP · entry and exit times · binary lifting · LCA and distances · rerooting
9units9benches43slides
15 PROBLEMS · OPEN →
15

Graphs · Traversal

Graph canvas + state panel
What it covers
BFS · DFS · cycle detection · bipartite · topological sort
22units22benches126slides
26 PROBLEMS · OPEN →
15

Graphs · Shortest Paths

Graph canvas + state panel
What it covers
Dijkstra · Bellman-Ford · Floyd-Warshall
15units15benches81slides
13 PROBLEMS · OPEN →
15

Graphs · MST · DSU · SCC

Graph canvas + state panel
What it covers
Prim · Kruskal · disjoint set · Kosaraju · Tarjan
13units13benches77slides
13 PROBLEMS · OPEN →
16

Dynamic Programming · Foundations

4-step ladder + DP table filler
What it covers
Memoize → tabulate → space-optimise · 1D recurrences (stairs, frog jump, pick/not-pick, circular) · the 2D turn · DP on grids (count → optimise → free endpoints) · 3D with two walkers
13units7benches72slides
12 PROBLEMS · OPEN →
16

Dynamic Programming · Subsequences

4-step ladder + DP table filler
What it covers
Subset sum · equal partition · minimum difference · counting subsets · partitions by difference · 0/1 and unbounded knapsack · coin change I and II · target sum · rod cutting
11units5benches63slides
11 PROBLEMS · OPEN →
16

Dynamic Programming · Strings & Stocks

4-step ladder + DP table filler
What it covers
LCS and its reconstruction · common substring · palindromic subsequences · insert/delete counts · shortest common supersequence · distinct subsequences · edit distance · wildcard matching · all six buy-and-sell-stock problems
16units4benches83slides
16 PROBLEMS · OPEN →
16

Dynamic Programming · LIS & Partition

4-step ladder + DP table filler
What it covers
LIS four ways including the O(n log n) binary search · divisible subsets · string chains · bitonic · counting LIS · matrix chain multiplication · cutting sticks · burst balloons · boolean parenthesisation · palindrome partitioning · maximal rectangle · counting squares
16units4benches82slides
16 PROBLEMS · OPEN →
16+

Data-Structure Design

The fields a class keeps in step · twelve benches
What it covers
An array as the whole state · buckets and chains · swapping with the last · two stacks around a cursor · versions per index · a list in expiry order · a stack per frequency · a list per use count · buckets by count in a linked list · lazy deletion in two heaps · merging the newest of each feed · a stack of open lists
12units12benches50slides
15 PROBLEMS · OPEN →
17

Tries

A trie that grows a node per letter, walks lit · twelve benches
What it covers
A node per prefix and a ring where a word ends · stopping at the first root · walking only through words · three suggestions kept at every node · a dot that tries every child · a board searched with the trie and cut as words are found · every word that starts at i · the words read backwards · counting a subtree of numbers without building it · bits as a path, the opposite bit taken · counts that let a trie forget
11units12benches52slides
15 PROBLEMS · OPEN →
18

Strings (Advanced)

Borders, boxes and windows in step · nine benches
What it covers
The prefix function · KMP search · a border gives the period · the border of s # reverse(s) · the Z function · an exact rolling code · binary search on the length with a rolling hash · Manacher's palindromes · the minimal rotation
9units9benches49slides
15 PROBLEMS · OPEN →
←→ or AD · drag · scroll
■ REQUEST REFUSED
1280×720
FIXED STAGE · NOT RESPONSIVE BY DESIGN

Open this on a laptop

Every deck is a fixed 1280 × 720 stage — hand-built animated visualisers, code mirrored beside the graph, problems laid out two columns wide. It scales as one piece, so on this screen the body text would land at about 4px.

That is not worth shipping to you, so we are not going to pretend otherwise.

THIS SCREEN0 × 0
NEEDED≥ 1060 × 610
WHAT IS WAITING FOR YOU
INVARIANT · WATCH IT RUN · THEN RUN IT FROM MEMORY