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
ExperiencesCoaching
New
Practice
Mock InterviewsTimed interview simulations with feedbackSuccess 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
Get started
LRU Cache Data Structure
00:00
5 left

LRU Cache Data Structure

HardPython

Problem

What data structure would you use to implement a LRU cache? Implement the cache operations using a hash map and doubly linked list so that get and put each run in O(1) time. The function receives a positive capacity and operations represented as ['get', key] or ['put', key, value], and returns the values produced by get, using -1 for missing keys.

Constraints

  • 1 <= capacity <= 10^5
  • 1 <= operations.length <= 10^5
  • Each operation is either ['get', key] or ['put', key, value]
  • Keys and values are integers
  • Each key is an integer

Function Signature

def lru_cache_operations(capacity, operations):
Interviewer

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

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