Preview build — question counts, lessons, and company notes on this site are placeholder data, not verified interview content.
Indwar

Cache with expiry and bounded memory

CodingMediumCorroborated · 5 reportsLast seen Aug 16, 2026

The question

Implement a cache with a maximum entry count and a per-entry TTL, with O(1) get and put. Then explain what changes if reads outnumber writes a thousand to one.

No write-up yet

We have the question but not yet a full breakdown. If you were asked this, the fastest way to improve the page is to say what the interviewer pushed on.

Add what you remember →

5 people reported this question.

I was asked this too

Also reported at Snowflake, Figma, Roblox.

Study the fundamentals: Core coding patterns