Implement a Data Structure Named by Interviewer

Implement a well-known data structure (a specific one named by the interviewer) in the programming language of your choice.

For this task, implement an LRU cache. Provide get and put operations with O(1) average time complexity.

Use implement_lru_cache(capacity, operations), where operations contains commands such as ["put", key, value] and ["get", key]. Return an array containing the result of each get, using -1 for missing keys.

Constraints

1 <= capacity <= 10^4
1 <= len(operations) <= 10^4
Keys and values are integers
Each operation is either ["get", key] or ["put", key, value]
A key appears at most once in the cache

Function Signature

def implement_lru_cache(capacity, operations):

Your question is Implement a Data Structure Named by Interviewer. 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 well-known data structure (a specific one named by the interviewer) in the programming language of your choice.

For this task, implement an LRU cache. Provide get and put operations with O(1) average time complexity.

Constraints

1 <= capacity <= 10^4
1 <= len(operations) <= 10^4
Keys and values are integers
Each operation is either ["get", key] or ["put", key, value]
A key appears at most once in the cache

Function Signature

def implement_lru_cache(capacity, operations):

Your question is Implement a Data Structure Named by Interviewer. 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.