Design a cache with a fixed capacity that supports the following operations, each in O(1) average time: - `get(key)`: return the value for key, or -1 if absent. A successful get marks the key as most…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.