LRU Cache Implementation | Dataford Interview Questions

Implement a function similar to an LRU cache.

Use operations to represent cache actions as ['put', key, value] or ['get', key]. Return a list containing the result of each get, using -1 for a missing key. The cache must evict the least recently used key when its capacity is exceeded, and both operations should run in O(1) time.

Constraints

1 <= capacity <= 10^5
0 <= operations.length <= 10^5
Each operation is either ['get', key] or ['put', key, value]
Keys are strings
Values are integers
A key appears at most once in the cache

Function Signature

def lru_cache(operations, capacity):

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

Implement a function similar to an LRU cache.

Constraints

1 <= capacity <= 10^5
0 <= operations.length <= 10^5
Each operation is either ['get', key] or ['put', key, value]
Keys are strings
Values are integers
A key appears at most once in the cache

Function Signature

def lru_cache(operations, capacity):

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.