LRU Cache
Understand and implement the Least Recently Used (LRU) cache data structure in Go to handle fixed capacity by evicting the oldest accessed data. This lesson helps you develop a functional LRU cache supporting set and get operations to optimize caching efficiency.
We'll cover the following...
We'll cover the following...
Statement
Implement an LRU cache struct with the following functions:
- NewLRUCache(capacity): Initializes an LRU cache with the capacity size.
- Set(key, value): Adds a new key-value