Process LRU Cache Get and Put Operations | Dataford Interview Questions

Implement a cache.

Asked in the Coding Test stage. Round 1 coding test for Data Engineer 1 (AmbitionBox review, Oct 2024).

Implement an LRU cache simulator. The function receives a positive capacity and a list of operations. Each operation is either ["put", key, value] or ["get", key]. Return the values from get operations in order, using -1 for missing keys. When full, evict the least recently used key. A successful get and every put make the key most recently used.

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

Function Signature

def lru_cache_operations(capacity, operations):

Your question is Process LRU Cache Get and Put Operations. 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.

Asked in the Coding Test stage. Round 1 coding test for Data Engineer 1 (AmbitionBox review, Oct 2024).

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

Function Signature

def lru_cache_operations(capacity, operations):

Your question is Process LRU Cache Get and Put Operations. 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.