Implement an LRU cache

An LRU (Least Recently Used) cache implementation tests understanding of data structure design, algorithmic efficiency, and cache management. Typically involves creating a data structure that maintains both fast access and a mechanism to remove the least recently used items when the cache reaches its capacity. Common implementation involves using a combination of a hash map and a doubly linked list to achieve O(1) time complexity for get and put operations.