Blog
Writing on case study, leetcode, dsa.
Rate Limiting in Distributed Systems: Token Bucket vs Sliding Window
A deep dive into the two most common rate limiting algorithms — when to use each, how they behave under burst traffic, and how to implement them with Redis.
How I Built an Exactly-Once Job Queue Without a Coordinator
Using Redis Lua atomics, lease expiry, and idempotency keys to achieve exactly-once semantics in a distributed job queue — without a central coordinator.
LeetCode #146 — LRU Cache: Every Way to Solve It
From brute force to the optimal O(1) doubly linked list + hashmap solution, with full Go implementation and complexity analysis.
How LSM-Trees Work: The Write-Optimized Structure Behind RocksDB
A bottom-up explanation of LSM-Trees — memtables, SSTables, compaction strategies, and why write-heavy databases love them.
Consistent Hashing Explained with Code
Why consistent hashing exists, how virtual nodes work, and a full Go implementation with benchmarks against modulo hashing.
7 Dynamic Programming Patterns That Cover 90% of LC Hard
Pattern recognition is the real skill in DP — Knapsack, LIS, Grid, Interval, Tree, Bitmask, and Digit DP patterns broken down with examples.