Interview Questions Interview Guides Experiences Mock Interviews Pricing

Interview Guides

All questions/Coding

Implement LRU Cache

MediumHash TablesQueueLinked Lists

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.

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.

Practice Python

Python 3.10

Open on desktop for the full Python editor with syntax highlighting and autocomplete.

Up next

Capgemini FSSBU

Design an LRU CacheMedium

Labelbox

LRU Cache for Fast RetrievalMedium

NTT DATA

Implement LRU Cache OperationsMedium

Implement LRU Cache | Dataford Interview Questions