LRU Cache Implementation | Dataford Interview Questions

Write LRU Cache with put and get method.

Asked in the DSA round stage. Implement an LRUCache supporting constant-time average get and put operations. When capacity is exceeded, evict the least recently used key.

Input and Output

Use lru_cache(capacity, operations), where each operation is ['put', key, value] or ['get', key]. Return the values produced by get, using -1 for missing keys.

Constraints

1 <= capacity <= 1000
1 <= len(operations) <= 1000
Keys and values are integers
Each operation is either ['put', key, value] or ['get', key]
A missing key must return -1

Function Signature

def lru_cache(capacity, operations):

Your question is LRU Cache Implementation. 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.

Problem