LRU Cache for Audio Segments

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is LRU Cache for Audio Segments. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

Implement a fixed-capacity cache for audio segments identified by string keys. The cache must support get(key) and put(key, value, size) in O(1) average time. When inserting a new segment would exceed the cache capacity, evict least recently used segments until enough space is available. Return -1 from get if the key is missing. If a segment's size is larger than the total capacity, do not store it.

Constraints

1 <= capacity <= 10^5
1 <= len(operations) <= 2 * 10^5
Each operation is either ["get", key] or ["put", key, value, size]
1 <= len(key) <= 100
1 <= size <= 10^5

Function Signature

def process_cache_operations(capacity, operations):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output