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

Design an Image Cache Library

HardCoding00:00
Practice interviewer
In session
5 left
00:00

Your question is Design an Image Cache Library. Take a moment with it on the right.

Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).

You need to log in / sign up to chat or submit.

Problem

Design an in-memory image cache library. The cache should support fast lookup by key, bounded memory usage, and automatic eviction when memory pressure increases. Explain how you would store entries, choose what to evict, and react to memory warnings or low-memory conditions.

What to Cover

  • Cache API and keying strategy
  • Eviction policy for hot vs cold images
  • Handling decoded images under memory pressure
  • Thread safety for concurrent reads and writes

Constraints

  • Memory budget is fixed and may shrink at runtime
  • Image entries vary widely in size
  • Lookups should remain fast under concurrent access
  • The cache should degrade gracefully instead of failing abruptly