Design an LRU cache class
Implement an LRU cache with fixed capacity and O(1) get/put operations, evicting the least recently used key when capacity is exceeded.
Example:
Input: value = 42
Output: 42
Write a clean implementation and validate it with the provided test cases.
Examples:
Input 1:
{"value":1}Output 1:
1Input 2:
{"value":42}Output 2:
42Loading editor...
Run your code to see results
Click the Run button above