dsa3 min read
Design Skiplist — Probabilistic Sorted Structure
Implement a skip list from scratch supporting search, add, and erase in O(log n) expected time. Uses layered linked lists with probabilistic level assignment.
Read →
All Posts
1575 articles
dsa2 min read
Design Log Storage System — Timestamp Range Retrieval
Design a log storage system that retrieves log IDs within a timestamp range at a specified granularity (Year, Month, Day, Hour, Minute, Second).
Read →
dsa2 min read
Design Phone Directory — Available Number Pool
Design a phone directory managing available and allocated numbers with O(1) get, check, and release using a queue of free numbers and a boolean availability array.
Read →
dsa3 min read
Design In-Memory Database — Multi-Field Filtering
Design an in-memory key-value database that supports set, get, delete, and rank operations. Demonstrates combining hashmaps with sorted structures for efficient multi-key queries.
Read →
dsa2 min read
Design Min Stack — O(1) Minimum with Auxiliary Stack
Implement a stack that supports push, pop, top, and retrieving the minimum element in O(1) time using an auxiliary min-stack that tracks minimums at each level.
Read →
Page 305 of 315