Thread-Safe O(1) LRU Cache | Dataford Interview Questions

Implement a thread-safe LRU cache with O(1) performance.

Implement lru_cache_operations(capacity, operations), where operations contains ['put', key, value] or ['get', key]. Return the results of all get operations in order, using -1 for missing keys. Every cache operation must be synchronized, and a successful get or put must mark the key as most recently used. The cache must evict the least recently used key when its capacity is exceeded.

Constraints

1 <= capacity <= 10^5
1 <= len(operations) <= 10^5
Each operation is either ['get', key] or ['put', key, value]
Keys and values are integers
All cache operations must be safe when called concurrently

Function Signature

def lru_cache_operations(capacity, operations):

Your question is Thread-Safe O(1) 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 a thread-safe LRU cache with O(1) performance.

Constraints

1 <= capacity <= 10^5
1 <= len(operations) <= 10^5
Each operation is either ['get', key] or ['put', key, value]
Keys and values are integers
All cache operations must be safe when called concurrently

Function Signature

def lru_cache_operations(capacity, operations):

Your question is Thread-Safe O(1) 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.