Add another method to 2sum Problem

Author: TemitopeAgbaje

LeetcodeProblems/Algorithms/2Sum.js

@@ -28,16 +28,26 @@ Output: [0,1]
  * @param {number} target
  * @return {number[]}
  */
- var twoSum = function(nums, target) {
-  let map ={};
-  for(let i=0;i<nums.length;i++){
-      const sum = target-nums[i];
-      if(map[parseInt(sum)] != 0){
-          return [map[sum], i];
-      } else{
-          map[nums[i]] = i;
+var twoSum = function (nums, target) {
+  let map = {};
+  for (let i = 0; i < nums.length; i++) {
+    const sum = target - nums[i];
+    if (map[parseInt(sum)] != 0) {
+      return [map[sum], i];
+    } else {
+      map[nums[i]] = i;
+    }
+  }
+
+  //Another method
+
+  for (let i = 0; i < nums.length; i++) {
+    for (let j = i + 1; j < nums.length; i++) {
+      if (nums[1] + nums[j] === target) {
+        return [i, j];
       }
+    }
   }
 };
 
-module.exports.twoSum = twoSum;
+module.exports.twoSum = twoSum;

LeetcodeProblemsTests/Algorithms/2Sum_Test.js

@@ -1,11 +1,11 @@
-const assert = require('assert');
-const twoSum = require('../../LeetcodeProblems/Algorithms/2Sum').twoSum;
+const assert = require("assert");
+const twoSum = require("../../LeetcodeProblems/Algorithms/2Sum").twoSum;
 
 var test = function () {
   assert.deepEqual([0,1], twoSum([2,7,11,15], 9));
   assert.deepEqual([1,2], twoSum([3,2,4], 6));
   assert.deepEqual([0,1], twoSum([3,3], 6));
-}
+};
 
 module.exports.test = test;
 

LeetcodeProblemsTests/Algorithms/3Sum_Closest_Test.js

@@ -1,10 +1,10 @@
-const assert = require('assert');
-const threeSumClosest = require('../../LeetcodeProblems/Algorithms/3SumClosest').threeSumClosest;
+const assert = require("assert");
+const threeSumClosest =
+  require("../../LeetcodeProblems/Algorithms/3SumClosest").threeSumClosest;
 
 var test = function () {
-  assert.equal(2, threeSumClosest([-1, 2 , 1, -4], 1));
+  assert.equal(2, threeSumClosest([-1, 2, 1, -4], 1));
   assert.equal(0, threeSumClosest([0, 0, 0], 1));
-  
-}
+};
 
 module.exports.test = test;

LeetcodeProblemsTests/Algorithms/3Sum_Test.js

@@ -1,22 +1,19 @@
-const assert = require('assert');
-const threeSum = require('../../LeetcodeProblems/Algorithms/3Sum').threeSum;
+const assert = require("assert");
+const threeSum = require("../../LeetcodeProblems/Algorithms/3Sum").threeSum;
 
 var test = function () {
   assert.deepEqual(threeSum([]), []);
   assert.deepEqual(threeSum([0]), []);
   assert.deepEqual(threeSum([0, 0]), []);
+  assert.deepEqual(threeSum([0, 0, 0]), [[0, 0, 0]]);
   assert.deepEqual(
-    threeSum([0, 0, 0]), 
+    threeSum([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]),
     [[0, 0, 0]]
   );
-  assert.deepEqual(
-    threeSum([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]), 
-    [[0, 0, 0]]
-  );
-  assert.deepEqual(
-    threeSum([-1, 0, 1, 2, -1, -4]), 
-    [ [ -1, 2, -1 ], [ 0, 1, -1 ] ]
-  );
-}
+  assert.deepEqual(threeSum([-1, 0, 1, 2, -1, -4]), [
+    [-1, 2, -1],
+    [0, 1, -1],
+  ]);
+};
 
 module.exports.test = test;

LeetcodeProblemsTests/Algorithms/Add_Two_Numbers_Test.js

@@ -1,7 +1,6 @@
-const assert = require('assert');
-const addTwoNumbers = require('../../LeetcodeProblems/Algorithms/Add_Two_Numbers').addTwoNumbers;
-const ListNodeTestHelper = require('../../UtilsClasses/ListNodeTestHelper');
-var ListNode = require('../../UtilsClasses/ListNode').ListNode;
+const addTwoNumbers = require("../../LeetcodeProblems/Algorithms/Add_Two_Numbers").addTwoNumbers;
+const ListNodeTestHelper = require("../../UtilsClasses/ListNodeTestHelper");
+var ListNode = require("../../UtilsClasses/ListNode").ListNode;
 
 function test() {
   const list1 = ListNode.linkenList([1,2,3,4]);

LeetcodeProblemsTests/Algorithms/Award_Budget_Cuts_Test.js

@@ -1,5 +1,5 @@
-const assert = require('assert');
-const cutAwardBadges = require('../../LeetcodeProblems/Algorithms/Award_Budget_Cuts').cutAwardBadges;
+const assert = require("assert");
+const cutAwardBadges = require("../../LeetcodeProblems/Algorithms/Award_Budget_Cuts").cutAwardBadges;
 
 function test() {
   assert.deepEqual(

Test.js

@@ -1,38 +1,47 @@
-const fs = require('fs');
+/* eslint-disable no-useless-escape */
+/* eslint-disable no-undef */
+const fs = require("fs");
 
-const TESTS_FOLDER = './LeetcodeProblemsTests/Algorithms/';
+const TESTS_FOLDER = "./LeetcodeProblemsTests/Algorithms/";
 const REGEX_PATTERN_HIDDEN_FILES = /(^|\/)\.[^\/\.]/g;
 
-var test_all = async function() {
+var test_all = async function () {
   try {
     const problems = await loadProblems();
-    for(i in problems) {
+    for (i in problems) {
       console.log("Solving: " + problems[i]);
       const problem = require(TESTS_FOLDER + problems[i]);
 
-      if (typeof(problem.test) !=='undefined') {
+      if (typeof problem.test !== "undefined") {
         problem.test();
         console.log("✅ Tests for " + problems[i] + " run successfully \n");
       } else {
-        console.warn(problem, "🔴 The problem " + problems[i] +  " doesn't have a test method implemented.\n");
-      } 
+        console.warn(
+          problem,
+          "🔴 The problem " +
+            problems[i] +
+            " doesn't have a test method implemented.\n"
+        );
+      }
     }
   } catch (error) {
     throw new Error(error);
   }
-}
+};
 
 var loadProblems = () => {
   return new Promise(function (resolve, reject) {
     fs.readdir(TESTS_FOLDER, (error, files) => {
       if (error) {
         reject(error);
       } else {
-        problems = files.filter(item => !(REGEX_PATTERN_HIDDEN_FILES).test(item));
+        problems = files.filter(
+          (item) => !REGEX_PATTERN_HIDDEN_FILES.test(item)
+        );
         resolve(problems);
       }
-    })
+    });
   });
-}
+};
 
 test_all();