Grokking the Anthropic Forward Deployed Engineer Interview
0% completed
Exercise: An LRU Cache That Gains Constraints
"Build an in-memory cache with a fixed capacity. When it is full, remove the item that was used longest ago. I will add requirements as you go."
The Aced prep guide reports this task in Anthropic's FDE loop: an LRU cache extended as constraints are added. The guide does not publish the exact wording or stages, so the request above and the four stages below are this course's own version.
A cache that removes the item read or written longest ago when it is full is called a least recently used (LRU) cache. Removing an item to make room is called an eviction.
.....
.....
.....
Like the course? Get enrolled and start learning!
Reading Progress
0%