LRU Cache (Least Recently Used)
Intermediate
Implement a fixed-capacity cache that evicts the least recently used item when full. Implement get(key) and put(key, value) both in O(1). Use a hash map + doubly-linked list.
Keywords
dsa
Python
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.