Day59

swolecoder · swolecoder · commit 30ee08a19509 · 2020-12-07T19:54:42.000-05:00
diff --git a/Day59/index.js b/Day59/index.js
@@ -0,0 +1,20 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function(nums, target) {
+    let map = {};
+
+    for(let i=0; i < nums.length; i++){
+        let y = target - nums[i];
+
+        if((y in map)){
+            return [map[y], i]
+        }else{
+            map[nums[i]] = i;
+        }
+    }
+
+    return [-1,-1]
+};
diff --git a/README.md b/README.md
@@ -133,4 +133,6 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
 
 |Day 57| [1492. The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/) | [javascript]()|[:memo:](https://leetcode.com/problems/the-kth-factor-of-n/)|Medium|
 
-|Day 58| [117. Populating Next Right Pointers in Each Node II](hhttps://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | [javascript]()|[:memo:](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)|Medium|
+|Day 58| [117. Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | [javascript]()|[:memo:](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)|Medium|
+
+|Day 59| [1. Two Sum](https://leetcode.com/problems/two-sum/) | [javascript]()|[:memo:](https://leetcode.com/problems/two-sum/)|Easy|
