167. Two Sum II - Input array is sorted

Author: Tushar Borole

.idea/workspace.xml

@@ -51,6 +51,7 @@
 | 590  | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/)                                   | [Solution](postorder_traversal.js)                                                                            | 616 ms           | 80.9 MB              | Easy       |
 | 783  | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)                           | [minimum_distance_between_bst_nodes.js](minimum_distance_between_bst_nodes.js)                                | 88 ms            | 34.7 MB              | Easy       |
 | 1013 | [Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/) | [partition_array_into_three_parts.js](partition_array_into_three_parts.js)                                    | 72 ms            | 39.6 MB              | Easy       |
+| 167  | [Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)                             | [two_sum_II.js](two_sum_II.js)                                                                                | 64 ms            | 35.5 MB              | Easy       |
 | 912  | [Sort an Array](https://leetcode.com/problems/sort-an-array/)                                                                     | [Solution](sort_an_array.js)                                                                                  | 7176 ms          | 38.9 MB              | Medium     |
 | 414  | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)                                                       | [third_maximum_number.js](third_maximum_number.js)                                                            | 76 ms            | 38 MB                | Easy       |
 | 701  | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/)                               | [Solution](insert_into_a_binary_search_tree.js)                                                               | 112 ms           | 41.9 MB              | Medium     |

README.md

@@ -0,0 +1,23 @@
+/**
+ * @param {number[]} numbers
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function(numbers, target) {
+  let hash = {};
+
+  for (let i = 0; i < numbers.length; i++) {
+    let current = numbers[i];
+    let diff = target - current; //?
+    if (hash.hasOwnProperty(diff)) {
+      let index1 = i + 1;
+      let index2 = hash[diff] + 1;
+      return [Math.min(index1, index2), Math.max(index1, index2)];
+    }
+    hash[current] = i;
+  }
+
+  return [-1, -1];
+};
+
+twoSum([-1, 0], -1); //?