Imagine you have an array, nums, of length $n$ that was originally sorted in non-decreasing (ascending) order. This array has been rotated between $1$ and $n$ times. For example, the sorted array $[0,2,3,3,5,7,11]$ can become:

• $[5,7,11,0,2,3,3]$, if rotated $3$ times

• $[0,2,3,3,5,7,11]$, if rotated $7$ times

A single rotation moves the last element to the front. So, if the original array is $[a[0], a[1], ..., a[n-1]]$, rotating it once produces $[a[n-1], a[0], a[1], ..., a[n-2]]$.

You are given a sorted, rotated array, nums, that may include duplicate elements. Your job is to return the minimum element in the array.

Constraints:

• $n ==$ nums.length

• $1 \leq n \leq 1000$

• $-1000 \leq$ nums[i] $\leq 1000$

• nums is sorted and rotated between $1$ and $n$ times.

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:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.