LRU Cache · Coding Interview Practice

LRU CacheDesign a Least Recently Used (LRU) cache supporting get and put in O(1) average time, evicting the least recently used key when full.Constraints

1 <= capacity <= 3000

0 <= key, value <= 10^5

At most 2 * 10^5 calls are made

Examples

Input: capacity = 2, put(1,1), put(2,2), get(1) Output: 1

Input: put(3,3) evicts key 2, get(2) Output: -1

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…