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
Simple Caching Mechanism
00:00
5 left

Simple Caching Mechanism

MediumPython

Problem

CloudSEK XVigil may repeatedly request the same threat intelligence record. Implement a fixed-capacity least recently used (LRU) cache to avoid recomputing recently accessed results.

Given a positive capacity and a sequence of cache operations, process each operation in order. A get returns the value for a key and marks that key as most recently used. A put inserts or updates a key and marks it as most recently used. If insertion exceeds capacity, evict the least recently used key.

Formal Specification

Implement lru_cache(operations, capacity), where operations is a list of operations represented as lists:

  • ['get', key]
  • ['put', key, value]

Return a list containing the result of every get operation. Return -1 when a key is absent. put operations do not add an output value.

Each operation must run in average O(1) time. Do not use a built-in cache implementation.

Constraints

  • 1 <= capacity <= 10^4
  • 1 <= len(operations) <= 10^5
  • Keys and values are integers
  • Each operation is either ['get', key] or ['put', key, value]
  • All operations are valid

Function Signature

def lru_cache(operations, capacity):
Interviewer

Your question is Simple Caching Mechanism. 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.