Design a data structure that follows the Least Recently Used (LRU) cache constraint. Implement get and put in O(1) time.
LRUCache(2) → put(1,1) → put(2,2) → get(1)→1 → put(3,3) → get(2)→-1 (evicted) → get(3)→3
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features