Implement LRU Cache | Dataford Interview Questions

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.

def LRUCache(capacity, commands=None):

Your question is Implement LRU Cache. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

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.

def LRUCache(capacity, commands=None):

Your question is Implement LRU Cache. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.