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
Array Pivot and Rotated Index
00:00
5 left

Array Pivot and Rotated Index

EasyPython

Problem

Grammarly's mobile suggestion surface stores candidate suggestions in sorted order. Given a sorted array of distinct integers, a rotation count, and a target value, determine the target's index after virtually rotating the array to the right by rotations positions. Do not physically modify or copy the array.

Return the target's zero-based index in the rotated array, or -1 when the target is absent.

Formal Specification

Implement find_index_after_rotation(nums, rotations, target).

  • nums: a sorted list of distinct integers in ascending order.
  • rotations: a non-negative integer. Rotations may be much larger than len(nums).
  • target: an integer to locate.
  • Return an integer containing the target's index after the right rotation.

Use binary search to locate the target in the original sorted array, then map that index into the rotated coordinate system. An empty array returns -1.

Constraints

  • 0 <= nums.length <= 100000
  • nums is strictly increasing
  • 0 <= rotations <= 10^18
  • -10^9 <= nums[i], target <= 10^9

Function Signature

def find_index_after_rotation(nums, rotations, target):
Interviewer

Your question is Array Pivot and Rotated Index. 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.