Design and implement an LFU (Least Frequently Used) cache with a fixed capacity supporting get(key) and put(key, value), both in O(1) average time. When full, evict the least frequently used key…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.