LRU Cache at Citadel
Medium46.8% acceptance
This problem has 75.0% frequency at Citadel.
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 Citadel Questions
Find Median from Data StreamHardMaximum Total Damage With Spell CastingMediumFirst Completely Painted Row or ColumnMediumLongest String ChainMediumInsert Delete GetRandom O(1)Medium
View all Citadel questions