Implement a Key-Value Cache with Per-Entry Expiration

Read the full interview experience this question came from →

Quick Overview

Design a byte-limited key-value cache with independent expiration per entry and oldest-live-entry eviction. Define replacement age, exact expiry behavior, lazy and proactive cleanup, capacity accounting, concurrency, and data structures that avoid returning stale values.

Implement a Key-Value Cache with Per-Entry Expiration

Company: Netflix

Role: Software Engineer

Category: Software Engineering Fundamentals

Difficulty: easy

Interview Round: Technical Screen

Overview: Design a byte-limited key-value cache with independent expiration per entry and oldest-live-entry eviction. Define replacement age, exact expiry behavior, lazy and proactive cleanup, capacity accounting, concurrency, and data structures that avoid returning stale values.

Read the full Netflix Software Engineer interview experience this question came from

Netflix logo
Netflix
Aug 21, 2026
easySoftware EngineerTechnical ScreenSoftware Engineering Fundamentals
8
0
Loading...