What are some examples of LRU implementation in programming?

Can you explain what LRU stands for and give me some implementation examples?

LRU stands for Least Recently Used. It's a cache eviction policy that removes the least recently accessed items first. An example implementation in Python could use a dictionary and a doubly linked list.

How would you implement LRU caching in Python?

You can use the collections.OrderedDict to maintain the order of access. When an item is accessed, you move it to the end of the dictionary. If the cache exceeds its limit, you remove the first item.

Can you show me a code snippet for that?

Sure! Here's a simple example:

from collections import OrderedDict

class LRUCache:
    def __init__(self, capacity: int):
        self.cache = OrderedDict()
        self.capacity = capacity

    def get(self, key: int) -> int:
        if key not in self.cache:
            return -1
        else:
            self.cache.move_to_end(key)
            return self.cache[key]

    def put(self, key: int, value: int) -> None:
        if key in self.cache:
            self.cache.move_to_end(key)
        self.cache[key] = value
        if len(self.cache) > self.capacity:
            self.cache.popitem(last=False)

What are the advantages of using LRU caching?

LRU caching helps improve performance by keeping frequently accessed data in memory, reducing the need for expensive data retrieval operations.