nickbalestra · April 7, 2018 02:34 · Apr 7, 2018 · Apr 7, 2018 · Apr 7, 2018
diff --git a/twoSum.js b/twoSum.js
@@ -11,7 +11,7 @@
  * Input:  nums = [2, 7], target = 9,
  * Output: [0, 1] // Because nums[0] + nums[1] = 2 + 7 = 9,
  *
- * Follow-up: What will change if the array of integers will be given sorted
+ * Follow-up: What will change if the given array of integers is sorted
  * 
  */
 

diff --git a/twoSum.js b/twoSum.js
@@ -8,7 +8,7 @@
  * and you may not use the same element twice.
  * 
  * Example:
- * Input:  nums = [2, 7, 11, 15], target = 9,
+ * Input:  nums = [2, 7], target = 9,
  * Output: [0, 1] // Because nums[0] + nums[1] = 2 + 7 = 9,
  *
  * Follow-up: What will change if the array of integers will be given sorted

diff --git a/twoSum.js b/twoSum.js
@@ -0,0 +1,20 @@
+/* 
+ * Two Sum
+ * 
+ * Given an array of integers, return indices of the two numbers
+ * such that they add up to a specific target.
+ * 
+ * You may assume that each input would have exactly one solution, 
+ * and you may not use the same element twice.
+ * 
+ * Example:
+ * Input:  nums = [2, 7, 11, 15], target = 9,
+ * Output: [0, 1] // Because nums[0] + nums[1] = 2 + 7 = 9,
+ *
+ * Follow-up: What will change if the array of integers will be given sorted
+ * 
+ */
+
+const twoSum = (nums, target) => {};
+
+module.exports = twoSum;
diff --git a/twoSum.test.js b/twoSum.test.js
@@ -0,0 +1 @@
+const twoSum = require('./twoSum')