Java: Find Minimum in Rotated Sorted Array II

Difficulty Level: HARD

Problem Statement:

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. Find the minimum element of this array.

The problem "Find Minimum in Rotated Sorted Array II" is similar to the previous problem but with an additional constraint: the array may contain duplicates. This adds complexity to the problem as we cannot guarantee that the minimum element will be distinct.

Input:

nums = [2,2,2,0,1]  

Output:

0
The minimum element in the array is 0.