Time: 33 ms (98.75%), Space: 14 MB (95.14%) - LeetHub

Author: mrprashantkumar

0153-find-minimum-in-rotated-sorted-array/0153-find-minimum-in-rotated-sorted-array.py

@@ -0,0 +1,11 @@
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        low, high = 0, len(nums)-1
+        while low<high:
+            mid = (low+high)//2
+            
+            if nums[mid]<=nums[high]:
+                high = mid
+            else:
+                low = mid+1
+        return nums[low]