Blog
Notes on data structures & algorithms, system design, and things I learn along the way.
Learning DSA? Follow the structured path — ordered articles from recursion to dynamic programming.→Why [] == ![] is true and other coercion puzzles — the actual rules behind == , truthiness, and the handful of habits that keep them from biting.
How binary search eliminates half the problem with every comparison, and how binary search trees turn the same idea into a data structure — with interactive animations.
What a closure actually is, how the scope chain makes it work, and the three places closures matter most — private state, the classic loop bug, and React hooks.
An interactive guide to debouncing and throttling — when to use each, how to implement them from scratch, and the edge cases that bite in production.
How hash maps actually work — hashing, buckets, collisions, and resizing — with an animated walkthrough and a from-scratch implementation.
A visual, step-by-step guide to the event loop — call stack, task queue, microtasks, and async/await — with interactive animations you can play through.
The rules that make promises predictable — state transitions, how .then chains really resolve, error propagation, and when to reach for all, allSettled, race, or any.
Why the classic interview question is really a lesson in composing data structures — with an animated walkthrough and two working implementations.
How APIs decide who gets throttled — token bucket, fixed and sliding windows, animated demos of each, and what changes when the limiter goes distributed.
Four ways to get server data to the browser without a refresh — animated message flows for each, and a decision guide drawn from building live-data UIs.
202 posts · page 20 of 21