Design an LRU Cache

Build an in-memory cache with a fixed capacity. It answers lookups by key and takes new entries, and when it is full it pushes out whichever entry has gone unused the longest.

How the round runs

Medium · 5 stages · 5 questions · 60 min

~6 min

Requirements Gathering

lists

~3 min

Identifying Core Entities

cards

~14 min

Designing Classes & Relationships

diagram

~28 min

Code Implementation

code

~9 min

Deep Dives

code

Set up your round

Level

Interviewer

Duration

Junior · Standard · 60 min