Your question is Python Caching Function. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Alvarez & Marsal analysis workflows may repeatedly request the same computed result. Implement a fixed-capacity least recently used (LRU) cache that stores integer key-value pairs and evicts the item that has not been accessed for the longest time.
Create a function that processes a sequence of cache operations and returns the results of all get operations. A get for a missing key must return -1. Both a successful get and a put operation make the key the most recently used item. If put updates an existing key, its value changes and its recency is refreshed.
Implement lru_cache_operations(capacity, operations).
capacity is a positive integer.operations is a list of commands. Each command is either ['get', key] or ['put', key, value].key and value are integers.get command, in input order.def lru_cache_operations(capacity, operations):