You’re given a rotated sorted array, arr, of length $n$, that is rotated clockwise between $1$ and $n$ times.

For example,

• Before rotation, arr $= [1,2,3,4,5,6,7,8]$

• After $3$ rotations, the array becomes $[6,7,8,1,2,3,4,5]$.

Mathematically, we can say that if the original array was $[a[0],a[1],a[2], ... ,a[n−1]]$, then each rotation changes the array as follows:

• First rotation: $[a[n−1],a[0],a[1],a[2],...,a[n−2]]$

• Second rotation: $[a[n−2],a[n−1],a[0],a[1],a[2],...,a[n−3]]$

• Third rotation: $[a[n−3],a[n−2],a[n−1],a[0],a[1],a[2],...,a[n−4]]$

In the example above, the minimum element is $1$ at index $3$.

For the given array, your task is to find the minimum element of this array.

Constraints:

• $n ==$ arr.length

• $1 \leq n \leq 1000$

• $-5000 \leq$ arr[i] $\leq 5000$

• All the elements of the array are distinct, that is, there are no duplicate elements.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Implement your solution in the following coding playground: