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
Constant-Time Randomized Set
00:00
5 left

Constant-Time Randomized Set

MediumPython

Problem

Match Group services need a lightweight set of active profile identifiers that supports fast updates and random profile selection. Implement randomized_set(operations, seed) so every insert, delete, and getRandom operation runs in average O(1) time.

Formal Specification

  • operations is a list of two-element lists: [operation, value] for insert and delete, or ['getRandom', null] for random selection.
  • operation is one of 'insert', 'delete', or 'getRandom'.
  • value is an integer when required and null for getRandom.
  • Return a list containing one result per operation. insert and delete return booleans. getRandom returns one currently stored integer.
  • Use seed to make random selections reproducible during testing. The returned value must be uniformly selected from the current set.
  • The input never calls getRandom when the set is empty.

Constraints

  • 1 <= operations.length <= 2 * 10^5
  • -10^9 <= value <= 10^9
  • Values are integers.
  • The set contains no duplicate values.
  • getRandom is never called when the set is empty.
  • seed is an integer.

Function Signature

def randomized_set(operations, seed):
Interviewer

Your question is Constant-Time Randomized Set. 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.