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
Thread-Safe Inference Result Cache
00:00
5 left

Thread-Safe Inference Result Cache

MediumPython

Problem

Arrowstreet Capital's model inference service repeatedly requests results for the same input features. Implement a fixed-capacity, thread-safe least recently used (LRU) cache that stores pre-computed inference results.

The cache must support get and put operations. A successful get marks the key as most recently used. When inserting a new key would exceed capacity, evict the least recently used key. Updating an existing key also makes it most recently used. Every cache operation must be protected so concurrent callers cannot corrupt the cache's internal state.

Formal Specification

Implement cache_inference_results(capacity, operations).

  • capacity is an integer greater than zero.
  • operations is a list of dictionaries. Each dictionary is either {"op": "get", "key": string} or {"op": "put", "key": string, "value": integer}.
  • Process operations in the supplied order and return a list containing the result of every get operation.
  • Return the stored integer for a hit and None for a miss.
  • The implementation must use a lock around shared cache state. The returned order follows the input operation order, while the cache class itself must be safe for concurrent callers.

Constraints

  • 1 <= capacity <= 10^5
  • 1 <= len(operations) <= 2 * 10^5
  • Keys are non-empty strings with length at most 64
  • Values fit within a signed 32-bit integer
  • Every operation is valid

Function Signature

def cache_inference_results(capacity, operations):
Interviewer

Your question is Thread-Safe Inference Result Cache. 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.