// TOPIC
#linked-lists
3 articles
◆◆IntermediateAmazonGoogle
01LRU Cache
The definitive guide to the LRU cache — how to combine a hash map and a doubly linked list to get O(1) get and put, why neither structure alone is enough, and how to walk the full implementation in an interview.
#lru-cache#hash-tables#linked-lists
11 min◆BeginnerAmazonMicrosoft
02Linked 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
11 min◆◆IntermediateAmazonMeta
03Fast & Slow Pointers (Cycle Detection)
Two pointers moving at different speeds — the tortoise and hare — detect cycles, find the middle of a linked list, and locate cycle starts, all in O(1) space. The single most-asked linked list technique in FAANG interviews.
#linked-lists#two-pointers#cycle-detection
12 min