Question: Write a Python program to implement a simple LRU (Least Recently Used) cache.

Answer:

from collections import OrderedDict
class LRUCache:
def __init__(self, capacity):
self.cache = OrderedDict()
self.capacity = capacity
def get(self, key):
if key in self.cache:
self.cache.move_to_end(key)
return self.cache[key]
return -1
def put(self, key, value):
if len(self.cache) >= self.capacity:
self.cache.popitem(last=False)
self.cache[key] = value
self.cache.move_to_end(key)

Example:

# Example usage:
lru_cache = LRUCache(3)
lru_cache.put(1, 1)
lru_cache.put(2, 2)
lru_cache.put(3, 3)
print(lru_cache.get(2)) # Output: 2

Is it helpful? Yes No

Most helpful rated by users:

Implement a function to find the maximum element in a list.
Write a function to reverse a string.
Implement a function to check if a string is a palindrome.
Write a Python function to check if a given year is a leap year.
Write a Python program to count the occurrences of each element in a list.