hard20 pts · first answer countshash-mapdesigncaching
Designing an O(1) LFU cache
An LFU cache evicts the least frequently used key, breaking ties by least recent use. Which design gives O(1) get and put?
Discussion 0
Join free to post in the discussion.
Related questions
- Redis TTL after SET with EXBackend Developer
- What a 92% cache hit ratio meansBackend Developer
- Which key an LRU cache evictsBackend Developer
- Why cache entries have a TTLBackend Developer
- Arabic text shown to English usersBackend Developer
- What a write-through cache doesBackend Developer
- Slow responses after a cache restartBackend Developer
- Average cost of a hash map lookupBackend Developer