Section 1Understand Problem
Section 01
Understand the problem
Restate the problem precisely. Interviewers reward candidates who pause, define the contract, and name the guarantees before coding.
Problem statement
Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement `LRUCache(capacity)`, `get(key)`, and `put(key, value)`. Both operations must run in O(1) average time.
Example
LRUCache(2); put(1,1); put(2,2); get(1); put(3,3); get(2); → 1, -1
Constraints
1 ≤ capacity ≤ 3000 · 0 ≤ key, value ≤ 10⁴ · Up to 2 × 10⁵ calls
Audio recording unsupported on this browser.
WPM—Fillers0Pace—Thinking0%
Explain the problem in your own words
0 words0 chars
AI Review
Write your thinking above first.
Once you've drafted a response, click Submit for AI review and a senior engineer will critique your reasoning.
Ready to submit Section 1?
The reviewer will check whether you stated inputs, output, guarantees, and any assumption you flagged.
Write at least a couple of sentences explaining the problem before submitting.