Simple Binary Search
\n    def findMin(self, nums: List[int]) -> int:\n        lo, hi = 0, len(nums)-1\n        while lo < hi:\n            mid = (lo+hi)//2\n            if nums[mid
```\n    def findMin(self, nums: List[int]) -> int:\n        lo, hi = 0, len(nums)-1\n        while lo < hi:\n            mid = (lo+hi)//2\n            if nums[mid] > nums[hi]:\n                lo = mid+1\n            else:\n                hi = mid\n        return nums[lo]\n```
['Python']