Rotated Array

Asked in:
Facebook

Problem Description

Suppose a sorted array A is rotated at some pivot unknown to you beforehand.

(i.e., 1 2 4 5 6 7 might become 4 5 6 7 1 2).

Find the minimum element.

The array will not contain duplicates.

Note:- Use the circular rotated property of the array to solve the problem.

Problem Constraints

1 <= len(A) <= 10⁵
1 <= A[i] <= 10⁹

Input Format

The first argument is an Integer array A.

Output Format

Return the minimum element of array A.

Example Input

Input 1:-

A = [7, 2, 4, 5]

Input 2:-

A = [3, 1, 2]

Example Output

Output 1:-

Output 2:-

Example Explanation

Explanation 1:-

2 is the minimum element in the aray.

Explanation 2:-

1 is the minimum element in the array.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Rotated Array on Interview Code Editor

Hints

Complete Solution

Asked In:

Facebook

Rotated Array

Discussion