Design a Data Structure | Dataford Interview Questions

How would you design a data structure to support efficient operations for a real workload, and what constraints would you optimize for?

Implement an LRU cache supporting set, get, and delete operations. get and set must update recency, and each operation should run in O(1) time. Return a list containing results only for get operations, using null for missing keys. For example, setting a, setting b, getting a, then setting c with capacity 2 evicts b.

Constraints

1 <= capacity <= 10^4
1 <= operations.length <= 10^3
Each operation is ["get", key], ["set", key, value], or ["delete", key]
Keys are non-empty strings
Values are integers
The result includes one element for every get operation, in order

Function Signature

def process_operations(operations, capacity):

Your question is Design a 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

How would you design a data structure to support efficient operations for a real workload, and what constraints would you optimize for?

Constraints

1 <= capacity <= 10^4
1 <= operations.length <= 10^3
Each operation is ["get", key], ["set", key, value], or ["delete", key]
Keys are non-empty strings
Values are integers
The result includes one element for every get operation, in order

Function Signature

def process_operations(operations, capacity):

Your question is Design a 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.