Given a sorted array of distinct integers which is rotated at some unknown pivot, find the number of times the array has been rotated. This is equivalent to finding the index of the minimum element in the array.
{
"nums": [
4,
5,
6,
7,
0,
1,
2
]
}4{
"nums": [
3,
4,
5,
1,
2
]
}3{
"nums": [
11,
13,
15,
17
]
}0Sign in to Run Code and Submit