Least Recently Used Cache | Dataford Interview Questions

Implement a cache with get and put operations that supports eviction of the least recently used item.

Implement def lru_cache(capacity, operations):, where capacity is a positive integer and operations is a list of [get, key] or [put, key, value] lists. Return the values produced by successful and unsuccessful get operations, using -1 for a missing key. Both get and put on an existing key mark it as most recently used. The implementation should achieve O(1) average time per operation.

Constraints

1 <= capacity <= 1000
1 <= len(operations) <= 1000
Each operation is either ["get", key] or ["put", key, value]
Keys and values are integers
A key appears at most once in a cache at any time

Function Signature

def lru_cache(capacity, operations):

Your question is Least Recently Used 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 with get and put operations that supports eviction of the least recently used item.

Constraints

1 <= capacity <= 1000
1 <= len(operations) <= 1000
Each operation is either ["get", key] or ["put", key, value]
Keys and values are integers
A key appears at most once in a cache at any time

Function Signature

def lru_cache(capacity, operations):

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