Add solution #167

Author: JoshCrozier

README.md

@@ -73,6 +73,7 @@
 145|[Binary Tree Postorder Traversal](./0145-binary-tree-postorder-traversal.js)|Easy|
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
 152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|
+167|[Two Sum II - Input Array Is Sorted](./0167-two-sum-ii-input-array-is-sorted.js)|Easy|
 169|[Majority Element](./0169-majority-element.js)|Easy|
 179|[Largest Number](./0179-largest-number.js)|Medium|
 191|[Number of 1 Bits](./0191-number-of-1-bits.js)|Easy|

solutions/0167-two-sum-ii-input-array-is-sorted.js

@@ -0,0 +1,34 @@
+/**
+ * 167. Two Sum II - Input Array Is Sorted
+ * https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/
+ * Difficulty: Easy
+ *
+ * Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order,
+ * find two numbers such that they add up to a specific target number. Let these two numbers
+ * be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length.
+ *
+ * Return the indices of the two numbers, index1 and index2, added by one as an integer array
+ * [index1, index2] of length 2.
+ *
+ * The tests are generated such that there is exactly one solution. You may not use the same
+ * element twice.
+ */
+
+/**
+ * @param {number[]} numbers
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function(numbers, target) {
+  const map = new Map();
+
+  for (let i = 0; i < numbers.length; i++) {
+    const diff = target - numbers[i];
+
+    if (map.has(diff)) {
+      return [map.get(diff) + 1, i + 1];
+    }
+
+    map.set(numbers[i], i);
+  }
+};