// TOPIC
#linked-lists
4 articles
◆◆◆AdvancedRedisGoogle
01Skip Lists: The Structure Redis Chose Over Balanced Trees
Skip lists replace tree rotations with coin flips: expected O(log n) search, insert, and delete in ~40 lines. Why Redis, LevelDB, and Java picked them.
#skip-lists#linked-lists#probabilistic-data-structures
18 min◆◆IntermediateAmazonGoogle
02LRU Cache
Implement an LRU cache with O(1) get and put: hash map plus doubly linked list, full Python code, eviction mechanics, and the interview traps.
#lru-cache#hash-tables#linked-lists
13 min◆BeginnerAmazonMicrosoft
03Linked Lists
The linked list data structure explained from first principles — nodes, pointers, O(1) insert at a known position, and why arrays still win most of the time.
#linked-lists#data-structures#pointers
13 min◆◆IntermediateAmazonMeta
04Fast & Slow Pointers (Cycle Detection)
Fast and slow pointers detect linked list cycles, find the middle, and locate cycle starts in O(1) space — the most-asked linked list interview technique.
#linked-lists#two-pointers#cycle-detection
14 min