Array interview problem | Java Code | Find Minimum in Rotated Sorted Array :- Bind 75 : Leetcode 153

[@DestinationFAANG]

Coding solution......................................................
class Solution {
public int findMin(int[] nums) {
int left = 0;
int right = nums.length - 1;
int result = nums[0];
if(right == 0){
return nums[0];
}
while (left