Time: 37 ms (88.19%), Space: 16.7 MB (96.33%) - LeetHub

Author: RootProgrammer

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

@@ -0,0 +1,20 @@
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        result = nums[0] # left most
+        left, right = 0, len(nums) - 1
+
+        while left <= right:
+            if nums[left] < nums[right]:
+                result = min(result, nums[left])
+                break
+
+            median = (left + right) // 2
+            result = min(result, nums[median])
+
+            # looking for correct portion
+            if nums[median] >= nums[left]:
+                left = median + 1
+            else:
+                right = median - 1
+
+        return result