'''Title : 154. Find Minimum in Rotated Sorted Array II
Difficulty = Hard
Description: Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e.,  [0,1,2,4,5,6,7] might become  [4,5,6,7,0,1,2]).

Find the minimum element.

The array may contain duplicates.'''


class Solution(object):



    def findMin(self, nums):


        nums = list(dict.fromkeys(nums))
        nums.sort()

        if len(nums)>0:
            return min(nums)
