Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
LRU Cache
Design a cache that evicts the least recently used item when full. It's one of the few problems that tests both data structure intuition and clean API design. Interviewers love it because it reveals whether you can combine a hash map with a linked list to get O(1) operations. This pattern shows up constantly in systems design.
Meet Allison & Tim
Your AI coaches
Practice coding interviews out loud with real-time voice coaching. Your code actually runs.
Desktop required to run this problem
StrongYes runs real code + tests in a desktop editor. Mobile is view-only for now, so you can’t start this here. Sorry about that — email yourself a link and pick it up on your computer.
Desktop required
Sorry — mobile can’t run the editor + tests yet. Email yourself a link to continue on desktop.