Algorithm Problem on Data Structures

HardPython

Problem

Solve a classic algorithmic problem related to data structures (e.g., arrays, linked lists, or hash maps). Implement an LRU cache supporting get and put operations in O(1) average time. The function receives a positive capacity and an operation list, returning values only for get operations, with -1 for missing keys; inserting into a full cache evicts the least recently used key. Use the signature and operation format below.

Constraints

1 <= capacity <= 100000
1 <= operations.length <= 5000
Each operation is either ["get", key] or ["put", key, value]
0 <= key <= 10^9
-10^9 <= value <= 10^9
Keys and values are integers

Function Signature

def lru_cache_operations(capacity, operations):

CodePython 3

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

Run your code to see test output here.