Loading…
LRU Cache is a medium coding interview question covering hash maps, linked list, design — the kind asked at FAANG (Facebook/Meta, Apple, Amazon, Netflix, Google) and AI-first companies like Anthropic, OpenAI, and Nvidia.
Design a data structure that follows the LRU (Least Recently Used) cache eviction policy.
Implement the `LRUCache` class with `get(key)` and `put(key, value)` operations, both in O(1) time.
Solution walkthrough on Pro
Upgrade to Pro to unlock the guided hints, the step-by-step walkthrough, solutions in Python, C++, Java, and Go, and complexity analysis.
What's inside this guide
What each one means, and how interviewers probe it.
Fully unlocked, no account needed — solutions, walkthroughs and follow-up answers included.
Or start the Study Plan — a week-by-week order for your loop, and week 1 is entirely free.
A full interview loop is more than one round. These are the others, each with what is on the site for it.