Search in Rotated Sorted Array at Goldman Sachs
Medium44.1% acceptance
This problem has 62.5% frequency at Goldman Sachs.
Problem Description
There is an integer array `nums` sorted in ascending order (with **distinct** values). Prior to being passed to your function, `nums` is **possibly left rotated** at an unknown index `k` (`1 <= k < nums.length`) such that the resulting array is `[nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1]...
Read full problem and hintsTopics
Also asked at 54 companies
More Goldman Sachs Questions
Trapping Rain WaterHardMedian of Two Sorted ArraysHardContainer With Most WaterMediumMinimum Path SumMediumFind Minimum in Rotated Sorted ArrayMedium
View all Goldman Sachs questions