LRU Cache at Netskope
Medium46.8% acceptance
This problem has 100.0% frequency at Netskope.
Problem Description
Design a data structure that follows the constraints of a **[Least Recently Used (LRU) cache](<https://en.wikipedia.org/wiki/Cache_replacement_policies#LRU>)**. Implement the `LRUCache` class: * `LRUCache(int capacity)` Initialize the LRU cache with **positive** size `capacity`. * `int get(int...
Read full problem and hintsTopics
Also asked at 127 companies
More Netskope Questions
LFU CacheHardLongest Substring Without Repeating CharactersMediumFirst Missing PositiveHardMerge k Sorted ListsHard
View all Netskope questions