Blog

One call with the wrong argument type, made once, makes the next 100 million integer additions roughly 3x slower. Hidden classes, inline caches, the tier-up thresholds and every deopt reason — checked against what Node 22 actually does, not what the blog posts say.

The Two Sum problem is the "Hello World" of hash map problems. Most people solve it, move on, and treat it as a warmup. That's a mistake. The pattern behind Two Sum — trading space for lookup speed — shows up in dozens of harder problems.

If you're still writing pages/api/... files in a new Next.js project, stop. Route Handlers are the App Router's replacement, and they're meaningfully better — typed, streaming-capable, and built on the same Web platform APIs that Cloudflare.

EJS, Handlebars, Pug and Nunjucks all do the same three things: tokenize, parse, compile. Build a real one — loops, conditionals, partials, escaping by default — and see exactly where HTML escaping stops protecting you.

Picture this: a live dashboard that polls for new notifications every 3 seconds. The count increments in state, the UI updates, everything looks right — except the interval callback is silently reading count = 0 on every tick, because it.

A rotated sorted array still has structure you can exploit. Learn the one insight that makes O(log n) search possible — and how to handle duplicates.

Stop re-summing from scratch — the fixed-size sliding window reduces O(n·k) nested loops to a single O(n) pass by adding one element and dropping one.

Most people reach for the nested loop on Two Sum — here's why the hash map pattern is the interview move, plus 3Sum and sorted variants.

LeetCode 4