#934Medium#1 in Intuit's list· asked at 52 companies
LRU Cache
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: ["LRUCache","put","put","get","put","get","put","get","get","get"] [[2],[1,1],[2,2],[1],[3,3],[2],[4,4],[1],[3],[4]] Output: [null,null,null,1,null,-1,null,-1,3,4]
put(3,3) evicts key 2; put(4,4) evicts key 1.
Constraints
- •
1 <= capacity <= 3000 - •
0 <= key <= 10^4 - •
0 <= value <= 10^5 - •
At most
2 * 10^5calls will be made togetandput.