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
Efficient Target Search
00:00
5 left

Efficient Target Search

EasyPython

Problem

An AMD ROCm validation utility stores device identifiers in ascending order. Given this sorted array and a target identifier, return the index of the target's first occurrence. Return -1 if the target is absent.

The solution must use binary search rather than scanning the array sequentially, because validation runs may contain millions of sorted entries.

Formal Specification

Implement find_first_device(device_ids, target).

  • Input: device_ids, a list of integers sorted in nondecreasing order, and target, an integer.
  • Output: An integer containing the smallest index i such that device_ids[i] == target, or -1 when no such index exists.
  • The input list must not be modified.

Constraints

  • 0 <= len(device_ids) <= 10^6
  • -10^9 <= device_ids[i] <= 10^9
  • -10^9 <= target <= 10^9
  • device_ids is sorted in nondecreasing order
  • The input list must not be modified

Function Signature

def find_first_device(device_ids, target):
Interviewer

Your question is Efficient Target Search. 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.