Dsa
Binary Search
Easy
Find Minimum Rotated Array
You are given a rotated sorted array of distinct integers. Your task is to find the minimum element in the array using binary search techniques.
Input Format:
- The first line contains an integer n (1 <= n <= 100000), the number of elements in the array.
- The second line contains n space-separated integers representing the elements of the array. These integers are distinct.
Output Format:
- Print the minimum element in the array.
Example:
Input:
7
4 5 6 7 0 1 2
Output:
0
Key concepts
binary_searcharraysorting
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now