two sum solution

Author: nowrobin

contains-duplicate/nowrobin.js

@@ -6,4 +6,4 @@ var containsDuplicate = function(nums) {
   return  new Set(nums).size != nums.length;
 };
 
-// 40ms 80.33MB
+// 40ms 80.33MB

two-sum/nowrobin.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+
+// 34ms 54mb
+var twoSum = function(nums, target) {
+        for (let i = 0; i < nums.length; i++) {
+        for (let j = i + 1; j < nums.length; j++) {
+            if (nums[j] === target - nums[i]) {
+                return [i, j];
+            }
+        }
+    }
+    return []
+};