← Questions
Implement an LRU cache
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Implement a least-recently-used cache with get(key) and put(key, value), both in O(1) time, with a fixed capacity.
Sign in to see the worked answer
The full answer, chapter by chapter, with what interviewers expect at each level. Free with an account: one full answer per company.
Sign in to see the worked answer
The full answer, chapter by chapter, with what interviewers expect at each level. Free with an account: one full answer per company.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding