LeetCode Solutions/Binary Search Study Plan/Binary Search II/Find Minimum in Rotated Sorted Array II.java
class Solution {
    public int findMin(int[] nums) {
        int left = 0, right = nums.length-1;
        while(left < right){
            int mid = (left + right) / 2;
            if(nums[mid] < nums[right]){
                right = mid;
            }
            else if(nums[mid] > nums[right]){
                left = mid + 1;
            } else{
                right--;
            }
        }
        return nums[left];
    }
}