Foundations
Math for computing
The math behind DSA: growth rates, logarithms, summations, combinatorics, modular arithmetic, probability, and graph theory - visualized and animated.
Start here (3)
The spine. Read these three in order; together they answer why log n is tiny, why nested loops are ~n², and why divide-and-conquer is n log n.
Growth rates & Big-O curves
Plot O(1)…O(n!) on one chart; watch how each bound scales as n grows.
Logarithms & exponents
Why log n appears in divide-and-conquer; exponent rules behind O(2ⁿ).
Summations & series
Arithmetic and geometric series that underpin merge sort and heap analysis.
Applied
Second ring: where the spine shows up in hashing, DP, and graphs. Same 7-block depth, one killer demo each.
Combinatorics basics
Permutations n!, combinations, subsets 2ⁿ - visualized with small n.
Modular arithmetic
Mod, congruences, inverses, Fermat - underpins hashing and prefix-mod DP.
Probability & expected value
Why hash map average is O(1); randomized algorithms and expected counts.
Graph theory foundations
Vertices, edges, degrees, paths and cycles; BFS/DFS complexity from adjacency.