JS: TwoSome from Leetcode

Author: hasib503

Programs/TwoSum.js

@@ -0,0 +1,47 @@
+// 1. Two Sum
+
+// Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
+// You may assume that each input would have exactly one solution, and you may not use the same element twice.
+// You can return the answer in any order.
+
+ 
+
+// Example 1:
+// Input: nums = [2,7,11,15], target = 9
+// Output: [0,1]
+// Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
+
+// Example 2:
+// Input: nums = [3,2,4], target = 6
+// Output: [1,2]
+
+// Example 3:
+// Input: nums = [3,3], target = 6
+// Output: [0,1]
+
+ 
+
+
+
+for (var i = 0; i < nums.length; i++) {
+
+    for (var n = 1; n < nums.length; n++) {
+
+        // console.log(nums[i] + nums[n])
+
+        if (nums[i] + nums[n] == target) {
+            if (nums[i] == nums[n]) {
+
+                console.log([nums.indexOf(nums[i]), nums.indexOf(nums[i]) + 1])
+
+            } else {
+                console.log([nums.indexOf(nums[i]), nums.indexOf(nums[n])])
+            }
+
+
+
+        }
+
+    }
+
+}