Problems/

LRU Cache Implementation

HARD
+40 XP Reward

LRU Cache Implementation

DSA
•38% Acceptance Rate•11,234 Submissions
Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class with get and put methods. Both operations must run in O(1) time complexity.

Related Topics:

Hash Table
Linked List
Design
Console Output
Click "Run Test Cases" to test with public inputs or "Submit Solution" to run full evaluation suite.