[01 / 04]Data StructuresO(n) bottom-up
Building a heap, from the bottom up
Why building a heap backwards runs in linear time.
Statewalk
Watch the state until it makes sense.
Interactive essays for understanding systems.
[02 / 04]AlgorithmsO(log n) boundary
Red and blue on a closed interval
Stop guessing with +1 and <= : binary search is just finding a boundary.
[03 / 04]Systems & DatabasesΔ-Join In-Memory
Keeping state alive: streaming joins without recomputing everything
Streaming database queries without recomputing the entire world.
[04 / 04]AlgorithmsSingle-Pass O(n)
Monotonic stacks: let the future resolve the past
Solve next-greater queries in one pass by letting the future settle the past.