All Problems

LFU Cache

Hard•data-structure•Expected: O(1) time, O(n) space•Interview Context
hash-map

Problem

Design a Least Frequently Used cache supporting get and put operations in O(1) time.

Loading...