EsLint and Tests fix

- A lot of files had Linting issues. Used EsLint to fix all the troublesome files.
- Fixed the tests that were failing. Node Tests.js should run just fine now!

Author: hot9cups

LeetcodeProblems/Algorithms/2Sum.js

@@ -32,7 +32,7 @@ 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) {
+    if (sum in map) {
       return [map[sum], i];
     } else {
       map[nums[i]] = i;
@@ -43,8 +43,8 @@ var twoSum = function (nums, target) {
 //Another method
 var twoSum2 = function (nums, target) {
   for (let i = 0; i < nums.length; i++) {
-    for (let j = i + 1; j < nums.length; i++) {
-      if (nums[1] + nums[j] === target) {
+    for (let j = i + 1; j < nums.length; j++) {
+      if (nums[i] + nums[j] === target) {
         return [i, j];
       }
     }

LeetcodeProblems/Algorithms/3SumClosest.js

@@ -30,31 +30,31 @@ Constraints:
  * @param {number} target
  * @return {number}
  */
- var threeSumClosest = function(nums, target) {
+var threeSumClosest = function(nums, target) {
   let mid = 1;
   let right = nums.length - 1;
   let currentSum = nums[0] + nums[mid] + nums[right];
   let closest = currentSum;
 
-  nums.sort(function(a,b) {return a - b})
+  nums.sort(function(a,b) {return a - b;});
 
   for(var left = 0 ; left < nums.length - 1; left++) {
-      mid = left + 1;
-      right = nums.length - 1;
+    mid = left + 1;
+    right = nums.length - 1;
 
-      while(mid < right) {
-          currentSum = nums[left] + nums[mid] + nums[right];
+    while(mid < right) {
+      currentSum = nums[left] + nums[mid] + nums[right];
 
-          if(Math.abs(target - currentSum) < Math.abs(target - closest)) {
-              closest = currentSum;
-          }
+      if(Math.abs(target - currentSum) < Math.abs(target - closest)) {
+        closest = currentSum;
+      }
 
-          if(currentSum > target) {
-              right--;
-          } else {
-              mid++;
-          }
+      if(currentSum > target) {
+        right--;
+      } else {
+        mid++;
       }
+    }
   }
 
   return closest;