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
Binary Search and Efficiency
00:00
5 left

Binary Search and Efficiency

EasyPython

Problem

The Expedia app maintains a sorted list of unique property IDs for a search result page. Implement binary search to return the index of a target property ID, or -1 if the ID is not present.

Formal Specification

Implement search_property_ids(property_ids, target):

  1. property_ids is a sorted list of unique integers in ascending order.
  2. target is an integer property ID.
  3. Return the zero-based index of target when it exists.
  4. Return -1 when target is absent.

Your solution must use binary search rather than scanning every element. Explain why the search is efficient and state its time and space complexity.

Constraints

  • 0 <= len(property_ids) <= 100000
  • -10^9 <= property_ids[i], target <= 10^9
  • property_ids is sorted in strictly ascending order

Function Signature

def search_property_ids(property_ids, target):
Interviewer

Your question is Binary Search and Efficiency. 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.