Least-Recently-Used Model Element Cache | Dataford Interview Questions

Implement a cache for frequently accessed model elements with least-recently-used eviction.

Use the signature def lru_cache_operations(capacity, operations):. Each operation is either ["put", key, value] or ["get", key], where keys are strings and values are integers. Return a list containing the result of every get operation, using None for a missing key. A successful get and every put mark the key as most recently used. Updating an existing key must not increase the cache size. When inserting into a full cache, evict the least recently used key.

Constraints

1 <= capacity <= 10^4
1 <= operations.length <= 1000
Each operation is either ["get", key] or ["put", key, value]
Keys are non-empty strings
Values are integers
A value is never None

Function Signature

def lru_cache_operations(capacity, operations):

Your question is Least-Recently-Used Model Element 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 cache for frequently accessed model elements with least-recently-used eviction.

Constraints

1 <= capacity <= 10^4
1 <= operations.length <= 1000
Each operation is either ["get", key] or ["put", key, value]
Keys are non-empty strings
Values are integers
A value is never None

Function Signature

def lru_cache_operations(capacity, operations):

Your question is Least-Recently-Used Model Element 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.