LFU Cache · Coding Interview Practice

LFU CacheDesign a Least Frequently Used cache with get(key) and put(key, value) in O(1) average time. When capacity is exceeded, evict the least frequently used key; break ties by evicting the least recently used among them.Constraints

1 <= capacity <= 10^4

0 <= key, value <= 10^5

At most 2 * 10^5 calls to get and put

Examples

Input: LFUCache(2), put(1,1), put(2,2), get(1), put(3,3), get(2), get(3) Output: [1, -1, 3]

Input: LFUCache(1), put(1,1), put(2,2), get(1), get(2) Output: [-1, 2]

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…