Python Data Structures Problem | Dataford Interview Questions

Solve a standard data structures problem using Python.

Implement an LRU cache supporting get and put operations in O(1) average time. The function receives a capacity and operation list, then returns the result of every get operation, using -1 for missing keys.

Signature: def lru_cache_operations(capacity, operations):. Each operation is ['get', key] or ['put', key, value]; keys and values are integers.

Constraints

1 <= capacity <= 10^4
1 <= operations.length <= 10^5
Each operation is either ['get', key] or ['put', key, value]
0 <= key <= 10^9
-10^9 <= value <= 10^9
Keys are integers and every get operation should produce one output value

Function Signature

def lru_cache_operations(capacity, operations):

Your question is Python Data Structures Problem. 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

Solve a standard data structures problem using Python.

Signature: def lru_cache_operations(capacity, operations):. Each operation is ['get', key] or ['put', key, value]; keys and values are integers.

Constraints

1 <= capacity <= 10^4
1 <= operations.length <= 10^5
Each operation is either ['get', key] or ['put', key, value]
0 <= key <= 10^9
-10^9 <= value <= 10^9
Keys are integers and every get operation should produce one output value

Function Signature

def lru_cache_operations(capacity, operations):

Your question is Python Data Structures Problem. 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.