Choosing the Right Data Structure | Dataford Interview Questions

Which data structure should we use here?

Implement an LRU cache that processes put and get operations. Choose a data structure that supports constant-time lookup, insertion, updates, and least-recently-used eviction.

lru_cache(operations, capacity) receives a list of operations and returns the values produced by each get. A missing key returns -1; every successful get marks the key as most recently used. Each operation is either ["get", key] or ["put", key, value].

Constraints

1 <= capacity <= 1000
0 <= operations.length <= 500
Each operation is either ["get", key] or ["put", key, value]
Keys and values are integers
A key appears at most once in a put operation's argument list

Function Signature

def lru_cache(operations, capacity):

Your question is Choosing the Right Data Structure. 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

Which data structure should we use here?

Implement an LRU cache that processes put and get operations. Choose a data structure that supports constant-time lookup, insertion, updates, and least-recently-used eviction.

Constraints

1 <= capacity <= 1000
0 <= operations.length <= 500
Each operation is either ["get", key] or ["put", key, value]
Keys and values are integers
A key appears at most once in a put operation's argument list

Function Signature

def lru_cache(operations, capacity):

Your question is Choosing the Right Data Structure. 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.