Find Minimum in Rotated Sorted Array
# written by Ashir
class Solution:
def findMin(self, nums: List[int]) -> int:
m = nums[0]
mid = 0
if len(nums) == 1:
return nums[0]
for i in range(len(nums) - 1):
if nums[i + 1] < nums[i]:
...
ashirmehmood.hashnode.dev1 min read