153. Find Minimum in Rotated Sorted Array

1function findMin(nums: number[]): number {
2    let left = 0;
3    let right = nums.length - 1;
4
5    while (left < right) {
6        const mid = left + Math.floor((right - left) / 2);
7        if (nums[mid] > nums[right]) {
8            left = mid + 1
9        } else {
10            right = mid
11        }
12    }
13
14    return nums[left]
15};