Add solution #35

Author: JoshCrozier

README.md

@@ -30,6 +30,7 @@
 28|[Implement strStr()](./0028-implement-strstr.js)|Easy|
 31|[Next Permutation](./0031-next-permutation.js)|Medium|
 33|[Search in Rotated Sorted Array](./0033-search-in-rotated-sorted-array.js)|Medium|
+35|[Search Insert Position](./0035-search-insert-position.js)|Easy|
 36|[Valid Sudoku](./0036-valid-sudoku.js)|Medium|
 41|[First Missing Positive](./0041-first-missing-positive.js)|Hard|
 42|[Trapping Rain Water](./0042-trapping-rain-water.js)|Hard|

solutions/0035-search-insert-position.js

@@ -0,0 +1,32 @@
+/**
+ * 35. Search Insert Position
+ * https://leetcode.com/problems/search-insert-position/
+ * Difficulty: Easy
+ *
+ * Given a sorted array of distinct integers and a target value, return the
+ * index if the target is found. If not, return the index where it would be
+ * if it were inserted in order.
+ *
+ * You must write an algorithm with O(log n) runtime complexity.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var searchInsert = function(nums, target) {
+  let start = 0;
+  let end = nums.length - 1;
+
+  while (start <= end) {
+    const middle = Math.floor((start + end) / 2);
+    if (target > nums[middle]) {
+      start = middle + 1;
+    } else {
+      end = middle - 1;
+    }
+  }
+
+  return start;
+};