hard20 pts · first answer countshash-maplru-cachesystem-design
Designing an O(1) LRU cache
An LRU cache needs get and put in O(1) and must evict the least recently used entry. What is the classic design?
Discussion 0
Join free to post in the discussion.
Related questions
- Average cost of a hash map lookupBackend Developer
- Worst case for a hash map lookupBackend Developer
- Removing duplicates with a SetBackend Developer
- Number keys in a plain objectBackend Developer
- Iteration order of a MapBackend Developer
- When to choose Map over a plain objectBackend Developer
- Set of look-alike objectsBackend Developer
- Counting letters in a wordBackend Developer