Blog

Dijkstra's algorithm is four lines of greedy logic wrapped in machinery that fails quietly, so this post builds a binary-heap implementation in TypeScript, differential-tests it against Floyd-Warshall on 4,000 random graphs, and measures what the heap, the Array.shift() queue and the stale-entry check actually cost.

Union Find trades every graph question except one for speed, and measured tree heights show exactly what path compression and union by rank each buy you — with tested solutions to Redundant Connection, Number of Connected Components, and Accounts Merge.

You have a UserService that needs a Database. Your OrderService needs UserService, Database, and a PaymentGateway. Your NotificationService needs EmailClient and UserService.

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.

You've run git commit thousands of times. But have you ever wondered what actually happens when you do? Git isn't a file-syncing tool with version numbers bolted on.