LRU Cache at Sprinklr
Medium46.8% acceptance
This problem has 50.0% frequency at Sprinklr.
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 Sprinklr Questions
Apply Operations on Array to Maximize Sum of SquaresHardNext Greater Numerically Balanced NumberMediumIsomorphic StringsEasySubarray Sum Equals KMediumMax Points on a LineHard
View all Sprinklr questions