Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan
LRU Cache Eviction Policy
00:00
5 left

LRU Cache Eviction Policy

EasyPython

Problem

Twitch mobile clients may cache recently viewed chat metadata to reduce repeated work while users switch between channels. Implement a fixed-capacity least-recently-used cache that supports constant-time retrieval, updates, and eviction.

The cache must process operations in order. A get returns the value for a key and marks that key as most recently used. A missing key returns -1. A put inserts or updates a key, marks it as most recently used, and evicts the least recently used key if capacity is exceeded.

Formal Specification

Implement lru_cache_operations(capacity, operations), where capacity is a positive integer and operations is a list of commands. Each command is either ['get', key] or ['put', key, value]. Keys and values are integers. Return a list containing the results of all get commands in their original order. put commands do not add an output.

Use a custom data structure. Do not use Python's built-in cache or ordered dictionary implementations.

Constraints

  • 1 <= capacity <= 10^5
  • 1 <= operations.length <= 2 * 10^5
  • Keys and values are integers in the range [-10^9, 10^9]
  • Every command is either ['get', key] or ['put', key, value]

Function Signature

def lru_cache_operations(capacity, operations):
Interviewer

Your question is LRU Cache Eviction Policy. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.
CodePython 3
Sign up free to run your codeLog inLn 2
Run your code to see test output here.