Implement a Data Structure or Algorithm | Dataford Interview Questions

Implement a common data structure or algorithm (typically Medium-level LeetCode difficulty). Implement an LRU cache that supports get and put operations in O(1) average time. The function receives an operation list and capacity, and returns the results of all get operations in order. Use operations shaped as ["get", key] or ["put", key, value].

Constraints

1 <= capacity <= 10^3
1 <= operations.length <= 10^4
Each operation is either ["get", key] or ["put", key, value]
0 <= key <= 10^9
-10^9 <= value <= 10^9
A get operation for a missing key returns -1

Function Signature

def lru_cache(operations, capacity):

Your question is Implement a Data Structure or Algorithm. 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

Constraints

1 <= capacity <= 10^3
1 <= operations.length <= 10^4
Each operation is either ["get", key] or ["put", key, value]
0 <= key <= 10^9
-10^9 <= value <= 10^9
A get operation for a missing key returns -1

Function Signature

def lru_cache(operations, capacity):

Your question is Implement a Data Structure or Algorithm. 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.