@hackproduct9: LRU Cache feels obvious when you see it move. 🧠📦 Every time a box is accessed, it jumps to the front. The boxes nobody touches slowly drift to the edge. When the cache is full and a new item arrives, the oldest ignored box falls off. That’s eviction. In code, LRU is usually built with a hash map + doubly linked list so `get` and `put` stay `O(1)`. The key thing to check: every access must refresh recency, not just inserts. Which pattern should we animate next? 👀 #LRUCache #Algorithms #DataStructures #CodingInterview #SystemDesign