Back to Questions

Design a Least Frequently Used (LFU) Cache

104K views•Asked at Google•
Hard

Question Explain

Design and implement a Least Frequently Used (LFU) cache. It should support `get` and `put` operations in $O(1)$ average time. This is one of the most complex $O(1)$ cache problems.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Reverse a Linked List

46K views

Kth Smallest Element in a BST

94.8K views

Lowest Common Ancestor of a BST

74.7K views
Design a Least Frequently Used (LFU) Cache - Interview Question