Binary Search Invariants
January 12, 2026 · 1 min read · 149 words · highfive
A compact way to think about binary search as an invariant instead of a memorized template.
Notes on algorithms, systems, dbms, CN and the web.
This is my personal knowledge base for DSA notes, competitive programming, system design, DBMS, computer networks, web development, debugging stories, and technical writeups.
January 12, 2026 · 1 min read · 149 words · highfive
A compact way to think about binary search as an invariant instead of a memorized template.
January 4, 2026 · 1 min read · 136 words · highfive
A practical note on writing recursive dynamic programming with explicit state and boring memo tables.
January 12, 2026 · 1 min read · 149 words · highfive
A compact way to think about binary search as an invariant instead of a memorized template.
January 4, 2026 · 1 min read · 136 words · highfive
A practical note on writing recursive dynamic programming with explicit state and boring memo tables.
December 21, 2025 · 1 min read · 96 words · highfive
Short notes on why cache invalidation is mostly a product of ownership and freshness requirements.
November 17, 2025 · 1 min read · 66 words · highfive
A small mental model for layouts, pages, route handlers, and server components in the App Router.