🔥 Find Minimum in Rotated Sorted Array

Author: maddhruv

README.md

@@ -4,11 +4,12 @@ Solutions of LeetCode Blind 75 Problems in JavaScript
 
 :goal_net: [Curated List of Top 75 LeetCode Questions](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU)
 
-| Problem                                                                 | Difficulty                                                | Tags                                               | LeetCode                                                                 |
-| ----------------------------------------------------------------------- | --------------------------------------------------------- | -------------------------------------------------- | ------------------------------------------------------------------------ |
-| [Two Sum](./two-sum.js)                                                 | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Hash Table`                              | [:link:](https://leetcode.com/problems/two-sum/)                         |
-| [Best Time to Buy and Sell Stock](./best-time-to-buy-and-sell-stock.js) | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Dynamic Programming`                     | [:link:](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |
-| [Contains Duplicate](./contains-duplicate.js)                           | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Set`, `Sorting`, `Hash Table`            | [:link:](https://leetcode.com/problems/contains-duplicate/)              |
-| [Product of Array Except Self](./product-of-array-except-self.js)       | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`                                            | [:link:](https://leetcode.com/problems/product-of-array-except-self/)    |
-| [Maximum Subarray](./maximum-subarray.js)                               | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Dynamic Programming`, `Divide & Conquer` | [:link:](https://leetcode.com/problems/maximum-subarray/)                |
-| [ Maximum Product Subarray](./maximum-product-subarray.js)              | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Dynamic Programming`                     | [:link:](https://leetcode.com/problems/maximum-product-subarray/)        |
+| Problem                                                                           | Difficulty                                                | Tags                                               | LeetCode                                                                      |
+| --------------------------------------------------------------------------------- | --------------------------------------------------------- | -------------------------------------------------- | ----------------------------------------------------------------------------- |
+| [Two Sum](./two-sum.js)                                                           | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Hash Table`                              | [:link:](https://leetcode.com/problems/two-sum/)                              |
+| [Best Time to Buy and Sell Stock](./best-time-to-buy-and-sell-stock.js)           | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Dynamic Programming`                     | [:link:](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)      |
+| [Contains Duplicate](./contains-duplicate.js)                                     | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Set`, `Sorting`, `Hash Table`            | [:link:](https://leetcode.com/problems/contains-duplicate/)                   |
+| [Product of Array Except Self](./product-of-array-except-self.js)                 | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`                                            | [:link:](https://leetcode.com/problems/product-of-array-except-self/)         |
+| [Maximum Subarray](./maximum-subarray.js)                                         | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Dynamic Programming`, `Divide & Conquer` | [:link:](https://leetcode.com/problems/maximum-subarray/)                     |
+| [ Maximum Product Subarray](./maximum-product-subarray.js)                        | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Dynamic Programming`                     | [:link:](https://leetcode.com/problems/maximum-product-subarray/)             |
+| [Find Minimum in Rotated Sorted Array](./find-minimum-in-rotated-sorted-array.js) | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Binary Search`                           | [:link:](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) |

find-minimum-in-rotated-sorted-array.js

@@ -0,0 +1,25 @@
+const findMin = (nums) => {
+  let result = nums[0],
+    low = 0,
+    high = nums.length - 1,
+    mid;
+
+  while (low <= high) {
+    if (nums[low] < nums[high]) {
+      result = Math.min(result, nums[low]);
+      break;
+    }
+
+    mid = Math.floor((low + high) / 2);
+
+    result = Math.min(result, nums[mid]);
+
+    if (nums[mid] >= nums[low]) {
+      low = mid + 1;
+    } else {
+      high = mid - 1;
+    }
+  }
+
+  return result;
+};