Implement an LRU cache with O(1) get and set
Task
A fixed-capacity cache. get and set in O(1). On overflow the least recently used item is evicted. A get makes an item "fresh".
The rest of this answer, with code and interview follow-ups, is in the DevPrep app.
Read the full answer in DevPrep