Every pattern runs as an animation next to the C++ that drives it. Step forward, step back, or run it on your own input.
Traversals, views, bottom-up recursion, BSTs, serialization, heaps, segment trees and tries.
BFS, DFS, cycles, topological sort, shortest paths, union-find, spanning trees, SCCs and bridges.
Insertion, merge, quick and heap sort, plus binary search and its many variants.
Reversal, fast and slow pointers, cycle detection, merging and reordering.
Grid paths, knapsack, subsequences and intervals, filled in one cell at a time.