Implement a least-recently-used cache.
Input: c = LRUCache(2) c.put(1, 1); c.put(2, 2) print(c.get(1)); c.put(3, 3) print(c.get(2)); c.put(4, 4) print(c.get(1), c.get(3), c.get(4)) Output: 1 -1 -1 3 4
Your program must print exactly this output for these test calls.
get and put in O(1)
Solve it in the live editor on this page — run on sample data, then submit against hidden tests.
{{ totalCount }} questions · {{ shHardPct }}% Hard. Data structures & algorithms interview problems in 13 patterns. Solve in Python, JavaScript or Java in your browser, run sample tests, then submit against hidden tests.
Guests can solve {{ freeLimit }} problems for free. Log in or sign up (free) to unlock everything, keep your streak and appear on the leaderboard. New to a topic? Learn it first in the DSA course.
{{ p.statement }}
{{ p.constraints }}
No submissions yet. Press Submit to judge your code against all tests.
The model solution and step-by-step explanation unlock when you solve this problem or after 3 unsuccessful submissions ({{ shFailsLabel }}). Struggling? Try the hints on the Question tab first.
{{ solutionCode }}
Create your free TechTown account to unlock every problem, track your progress, bookmark questions and keep preparing for interviews.