[Java & OOP] Find Minimum in Rotated Sorted Array

Question

Problem Statement for Find Minimum in Rotated Sorted Array under Java & OOP:

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. Find the minimum element in this array.

Input Constraints:
- 1 <= len(nums) <= 10^5
- Elements fit in memory standard spaces.

Accepted Answer

```
def findMin(nums):
    left, right = 0, len(nums) - 1
    while left < right:
        mid = (left + right) // 2
        if nums[mid] > nums[right]:
            left = mid + 1
        else:
            right = mid
    return nums[left]
```

[Java & OOP] Find Minimum in Rotated Sorted Array

Problem Statement

Proposed Solution

Your Progress

Save Progress?