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 on Rotated Array
00:00
5 left

Binary Search on Rotated Array

EasyPython

Problem

Grab's mobile systems may receive sorted identifier data that has been rotated when batches are partitioned or refreshed. Given a rotated sorted array of distinct integers, return the index of a target value using binary search.

The array was originally sorted in strictly increasing order, then rotated at an unknown position. Return -1 if the target is not present.

Formal Specification

Implement search(nums, target).

  • Input: nums, a list of distinct integers, and target, an integer.
  • Output: The zero-based index of target in nums, or -1 when it is absent.
  • The input array must not be modified.

Constraints

  • 0 <= nums.length <= 5000
  • -10^4 <= nums[i], target <= 10^4
  • All values in nums are distinct
  • nums is formed by rotating a strictly increasing array zero or more positions

Function Signature

def search(nums, target):
Interviewer

Your question is Binary Search on Rotated Array. 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.