Implement an LRU Cache | Dataford Interview Questions

Implement an LRU Cache.

Asked in the Final Round, Round 3, Hiring Manager stage. The task was asked in the last 20 minutes of the final interview round.

Implement lru_cache(capacity, operations). capacity is a positive integer. Each operation is ['put', key, value] or ['get', key]. Return an array containing the result of every get: the stored value, or -1 if the key is absent. A put updates an existing key and marks it as most recently used. When the cache exceeds capacity, evict the least recently used key.

Constraints

1 <= capacity <= 10^5
1 <= operations.length <= 10^5
Each key and value is an integer
Keys are unique within the cache at any moment
Each operation is either ['get', key] or ['put', key, value]

Function Signature

def lru_cache(capacity, operations):

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

Asked in the Final Round, Round 3, Hiring Manager stage. The task was asked in the last 20 minutes of the final interview round.

Constraints

1 <= capacity <= 10^5
1 <= operations.length <= 10^5
Each key and value is an integer
Keys are unique within the cache at any moment
Each operation is either ['get', key] or ['put', key, value]

Function Signature

def lru_cache(capacity, operations):

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