📌 Python3 simple naive solution with binary search
\nclass Solution:\n    def findMin(self, nums: List[int]) -> int:\n        start = 0\n        end = len(nums) - 1\n        \n        if(nums[start] <= nums[end]
```\nclass Solution:\n    def findMin(self, nums: List[int]) -> int:\n        start = 0\n        end = len(nums) - 1\n        \n        if(nums[start] <= nums[end]):\n            return nums[0]\n        \n        while start <= end:\n            mid = (start + end) // 2\n            \n            if(nums[mid] > nums[mid+1]):\n                return nums[mid+1]\n            \n            if(nums[mid-1] > nums[mid]):\n                return nums[mid]\n            \n            if(nums[mid] > nums[0]):\n                start = mid + 1\n            else:\n                end = mid - 1\n                \n        return nums[start]\n```
['Binary Search', 'Python3']