Implement LRU Cache

MediumPython00:00

Practice interviewer

Your interviewer

In session

Interviewer

Welcome to the Python screen.

The question is on your right: Implement LRU Cache. Read through the requirements first.

Run and submit your code as often as you need. You also have five interviewer messages this session - want to talk through your approach, or are you ready to start coding?

You need to log in / sign up to run or submit.

Problem

Design a data structure that implements an LRU (Least Recently Used) cache. The cache should support the following operations:

get(key): Retrieve the value of the key if the key exists in the cache, otherwise return -1.
put(key, value): Update the value of the key if the key exists. If the key does not exist, add the key-value pair to the cache. If the cache reaches its capacity, it should invalidate the least recently used item before inserting a new item.

Constraints

1 <= capacity <= 3000
-10^4 <= key, value <= 10^4

Function Signature

def LRUCache(capacity):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output