Hash Tables Under the Hood: Hashing, Collisions, and Resizing
Understand hash-table correctness through hashing, collision resolution, deletion, load factors, and incremental resizing.
2026-07-03 · 13 min read
Understand hash-table correctness through hashing, collision resolution, deletion, load factors, and incremental resizing.
2026-07-03 · 13 min read
Build scheduler-ready priority queues with heap invariants, stable ties, indexed updates, and measurable operational limits.
2026-06-21 · 13 min read
Build a Unicode-aware trie for exact lookup, prefix search, ranked autocomplete, deletion, and production-scale tradeoffs.
2026-06-20 · 15 min read
Derive disjoint set union from partition invariants, then apply path compression and weighted union to connectivity workloads.
2026-06-09 · 13 min read
Solve optimization problems by proving a monotone feasibility predicate and preserving explicit search-boundary invariants.
2026-05-27 · 14 min read
Compare deterministic and hash-based substring search while making collisions, Unicode units, and verification contracts explicit.
2026-05-15 · 14 min read
Design bounded-memory stream processors with explicit sampling, frequency, cardinality, merge, and error contracts.
2026-05-03 · 14 min read
Treat random choices as explicit inputs and reason precisely about correctness, expected cost, error probability, and reproducible tests.
2026-04-21 · 15 min read
Build fast feasible solutions with explicit approximation ratios, lower bounds, rounding, local search, and verification against exact small cases.
2026-04-09 · 14 min read
Derive next-boundary, histogram, sliding-window, and contribution algorithms from explicit ordered-candidate invariants.
2026-03-28 · 14 min read
A practical guide to choosing, implementing, and testing graph traversal, shortest-path, and dependency algorithms in TypeScript.
2026-03-21 · 14 min read
Learn how Bloom filters trade a controlled false-positive rate for compact, fast membership checks across caches and databases.
2025-10-24 · 14 min read