Implementing a Basic Cache | Dataford Interview Questions

Write a piece of code to implement a basic cache system. Implement basic_cache(capacity, operations), where each operation is ['get', key] or ['put', key, value]. Return the values produced by get operations, using -1 for missing keys; when full, evict the least recently used key. Both get and put on an existing key make it most recently used.

Constraints

1 <= capacity <= 10^4
0 <= operations.length <= 10^4
Each operation is either ['get', key] or ['put', key, value]
Keys and values are integers
Keys supplied to operations are valid integers

Function Signature

def basic_cache(capacity, operations):

Your question is Implementing a Basic 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

Constraints

1 <= capacity <= 10^4
0 <= operations.length <= 10^4
Each operation is either ['get', key] or ['put', key, value]
Keys and values are integers
Keys supplied to operations are valid integers

Function Signature

def basic_cache(capacity, operations):

Your question is Implementing a Basic 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.