Implement an LRU (least recently used) cache with get(key) and put(key, value), both in O(1) average time, evicting the least recently used entry when capacity is exceeded. Do not use LinkedHashMap or…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.