Data Structures

2026

May 28
Time-Traveling Through Data
What if a key could remember its entire past? Explore how append-only history, binary search, and tombstones combine to build a versioned key-value store — and why the same ideas power MVCC databases and distributed systems.
Data Structures & Algorithms

Sep 14
The Fragile Elegance of Open Addressing
What makes an array both powerful and brittle? Discover how open addressing pushes hash tables to their limits—where beauty meets the edge of performance collapse.
Data Structures & Algorithms
Jan 26
The Linked Hashmap Blueprint
What happens when keys collide? In this deep dive, we explore how linked hashmaps resolve collisions, maintain efficiency, and dynamically adapt to growing data.
Data Structures & Algorithms

Nov 1
Understanding Skip lists
Could skipping through data be faster than balancing trees? Dive into the fascinating mechanics of skip lists, where probability shapes efficiency.
Data Structures & Algorithms