Coding Exercises Medium O(1) Sign in to star LRU Cache Store items in an OrderedDict, move keys to the end whenever they are read or updated, and evict the oldest item when capacity is exceeded. Implement an LRU cache with O(1) get and put operations. #cache #design #hash-map #python Reveal full solution