LRU Cache at Google
Medium46.8% acceptance
This problem has 62.5% frequency at Google.
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 Google Questions
Two SumEasyAdd Two NumbersMediumLongest Substring Without Repeating CharactersMediumLongest Consecutive SequenceMediumReverse Linked ListEasy
View all Google questions