LFU Cache at Netskope

Hard48.6% acceptance

This problem has 100.0% frequency at Netskope.

Problem Description

Design and implement a data structure for a [Least Frequently Used (LFU)](<https://en.wikipedia.org/wiki/Least_frequently_used>) cache. Implement the `LFUCache` class: * `LFUCache(int capacity)` Initializes the object with the `capacity` of the data structure. * `int get(int key)` Gets the val...

Read full problem and hints

Topics

Hash Table Linked List Design Doubly-Linked List

Also asked at 30 companies

Amazon Apple Bloomberg Citadel Coupang DevRev DoorDash Gameskraft Goldman Sachs Google KLA KLA Tencor LinkedIn Meta Microsoft Nutanix Olx Oracle PayPal Rippling+10 more

View Full Problem

Problem Description

Topics

Also asked at 30 companies

More Netskope Questions