โ† Amazon questions

Implement LRU cache using circular linked list

Filed under Amazon

Implement an LRU (Least Recently Used) cache using a circular doubly linked list and a hash map. The cache should support get(key) and put(key, value) operations in O(1) time.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.