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
HashMap Implementation
00:00
5 left

HashMap Implementation

HardPython

Problem

Fancode services need a lightweight key-value structure for frequently accessed live-match metadata. Implement a custom HashMap using an array, a hash function, open addressing, linear probing, deletion, and automatic resizing. Do not use Python's built-in dict or any library map.

Create hash_map_operations(operations), where each operation is one of:

  • ['put', key, value]: insert or update a key. Produce no output for this operation.
  • ['get', key]: return the stored value, or -1 if the key is absent.
  • ['remove', key]: delete the key and return True if it existed, otherwise False.

Return a list containing outputs only for get and remove operations, in their original order. Keys and values are integers. The implementation must correctly handle collisions, updates, deletions, negative keys, and resizing. Use tombstones or an equivalent strategy so deletion does not break probe sequences.

Constraints

  • 1 <= len(operations) <= 10^5
  • Keys and values are signed 32-bit integers
  • The initial table capacity is 8
  • The table resizes before its effective load factor reaches 0.5
  • Operation names are valid and use the specified formats

Function Signature

def hash_map_operations(operations):
Interviewer

Your question is HashMap Implementation. 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.