surbhi498
diff --git a/‎10 October LeetCode Challenge 2021/23_findMinInRotatedSorted.cpp
Copy file name to clipboard
+23Lines changed: 23 additions & 0 deletions b/‎10 October LeetCode Challenge 2021/23_findMinInRotatedSorted.cpp
Copy file name to clipboard
+23Lines changed: 23 additions & 0 deletions
@@ -0,0 +1,23 @@
+ int findMin(vector<int>& nums) {
+        
+        int l = 0, r = nums.size()-1;
+        
+        if(nums[l]<nums[r]) // already sorted (0 rotation)
+            return nums[0]; // return first element
+    
+        while(l<r)
+        {
+            int mid = l + (r-l)/2; // finding middle
+            
+            if(nums[mid]>nums[r]){
+                l = mid + 1;
+            }
+            else if(nums[l]>nums[mid]){
+                r = mid;
+            }
+            else{
+                r--; //overcome duplicate elements
+            }
+        }
+        return nums[r];   
+    }