🔥 Search in Rotated Sorted Array

Author: maddhruv

README.md

@@ -13,3 +13,4 @@ Solutions of LeetCode Blind 75 Problems in JavaScript
 | [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/) |
+| [Search in Rotated Sorted Array](./search-in-rotated-sorted-array.js)             | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Binary Search`                           | [:link:](https://leetcode.com/problems/search-in-rotated-sorted-array/)       |

search-in-rotated-sorted-array.js

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