Data Structures Coding With Optimization | Dataford Interview Questions

Solve a coding problem involving data structures, with a follow-up task to optimize for performance or specific edge cases.

Implement an LRU cache interface using operations and capacity. Each operation is ['put', key, value] or ['get', key]; return the values produced by get operations, using -1 for missing keys. When capacity is exceeded, evict the least recently used key. The optimized solution should make both get and put O(1) and handle updates, repeated access, and capacity one.

Constraints

1 <= capacity <= 10^5
1 <= len(operations) <= 10^4
Each operation is either ['get', key] or ['put', key, value]
Keys and values are integers
A get operation returns -1 when its key is absent

Function Signature

def lru_cache_operations(operations, capacity):

Your question is Data Structures Coding With Optimization. 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

Solve a coding problem involving data structures, with a follow-up task to optimize for performance or specific edge cases.

Constraints

1 <= capacity <= 10^5
1 <= len(operations) <= 10^4
Each operation is either ['get', key] or ['put', key, value]
Keys and values are integers
A get operation returns -1 when its key is absent

Function Signature

def lru_cache_operations(operations, capacity):

Your question is Data Structures Coding With Optimization. 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.