You are given a sorted array that has been rotated at some pivot unknown to you. You are also given a target value to search for in the array. Implement an algorithm to find the index of the target value in the rotated array. If the target value is not found, return -1.

Question

Accepted Answer

Search a number in sorted rotated array.

Use binary search to find the pivot point where the array is rotated
Determine which half of the array the target number may be in
Perform binary search on the appropriate half of the array to find the target number

Accepted Answer

Use binary search to find the pivot point where the array is rotated

Determine which half of the array the target number may be in

Perform binary search on the appropriate half of the array to find the target number

Accepted Answer

Use binary search to find the pivot point where the array is rotated

Determine which half of the array the target number may be in

Perform binary search on the appropriate half of the array to find the target number

Accepted Answer

Use binary search to find the pivot point where the array is rotated
Determine which half of the array the target number may be in
Perform binary search on the appropriate half of the array to find the target number

Accepted Answer

An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array at some pivot unknown to you beforehand. So for instance, 1 2 3 4 5 might become 3 4 5 1 2. Devise a way to find an element in the rotated array in O(log n) time

You are given a sorted array that has been rotated at some pivot unknown to you. You are also given a target value to search for in the array. Implement an algorithm to find the index of the target value in the rotated array. If the target value is not found, return -1.

Amazon Intern interview questions & answers

Popular interview questions of Intern