Implement LRU Cache
Implement a Least Recently Used (LRU) cache.
We'll cover the following
Implement an LRU cache class with the following functions:
LRUCache(size): Initializes an LRU cache with the capacity size.
get(key): Returns the value of the key, or
-1if the key does not exist.
set(key, value): Adds a new key-value pair or updates an existing key with a new value.
After adding a new key, if the number of keys exceeds the cache capacity, evict the least recently used key and add the new one.
Let’s take an example of a cache with a capacity of four elements. The diagram below represents the cache state after accessing all four elements in order
4. All these four elements have been stored in an order where the head of the cache has the most recently accessed element, and the tail has the least recently used element.