LRU Cache

Total Accepted: 34106 Total Submissions: 232298 My Submissions

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.

get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
set(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.

Show Tags

Have you met this question in a real interview?

Yes

Discuss

Runtime Error Message:	{[{ runtimeError }]}
Last executed input:	{[{ lastExecutedTestCase }]}

Input:	{[{ resultWaTestCaseInput }]}
Output:	{[{ resultWaTestCaseOutput }]}
Expected:	{[{ resultWaTestCaseExpected }]}

LRU Cache

Submission Result: {[{ statusText }]}More Details

Share your acceptance!