formatting of JS files

src/main/java/challenges/c20201001_20201007/CombinationSum/combination_sum.js

@@ -3,22 +3,20 @@
  * @param {number} target
  * @return {number[][]}
  */
-var combinationSum = function(candidates, target) {
-    let result = [
-        []
-    ];
-    candidates.sort();
-    candidates.reverse();
-    if (target % candidates[0]) {
-        let tempResult = [];
-        for (let i = 0; i < Math.floor(target / candidates[0]); i++) {
-            tempResult.push(i);
-        }
-        result.push(tempResult);
+var combinationSum = function (candidates, target) {
+  let result = [[]];
+  candidates.sort();
+  candidates.reverse();
+  if (target % candidates[0]) {
+    let tempResult = [];
+    for (let i = 0; i < Math.floor(target / candidates[0]); i++) {
+      tempResult.push(i);
     }
-    return result;
+    result.push(tempResult);
+  }
+  return result;
 };
 
 module.exports = {
-    combinationSum
-}
+  combinationSum,
+};

src/main/java/challenges/c20201001_20201007/CombinationSum/combination_sum.test.js

@@ -1,38 +1,24 @@
-const { combinationSum } = require("./combination_sum");
-
-describe.each([
-    [
-        [2, 3, 6, 7], 8, [
-            [2, 2, 3],
-            [7]
-        ]
-    ],
-    [
-        [2, 3, 5],
-        8, [
-            [2, 2, 2, 2],
-            [2, 3, 3],
-            [3, 5],
-        ],
-    ],
-    [
-        [2], 1, []
-    ],
-    [
-        [1], 1, [
-            [1]
-        ]
-    ],
-    [
-        [1], 2, [
-            [1, 1]
-        ]
-    ],
-])(
-    "combinationSum(%o, %i) should equal %i",
-    (candidates, target, expectedResult) => {
-        test(`candidates = ${candidates}, target = ${target}, returns ${expectedResult}`, () => {
-            expect(combinationSum(candidates, target)).toEqual(expectedResult);
-        });
-    }
-);
+const { combinationSum } = require("./combination_sum");
+
+describe.each([
+  [[2, 3, 6, 7], 8, [[2, 2, 3], [7]]],
+  [
+    [2, 3, 5],
+    8,
+    [
+      [2, 2, 2, 2],
+      [2, 3, 3],
+      [3, 5],
+    ],
+  ],
+  [[2], 1, []],
+  [[1], 1, [[1]]],
+  [[1], 2, [[1, 1]]],
+])(
+  "combinationSum(%o, %i) should equal %i",
+  (candidates, target, expectedResult) => {
+    test(`candidates = ${candidates}, target = ${target}, returns ${expectedResult}`, () => {
+      expect(combinationSum(candidates, target)).toEqual(expectedResult);
+    });
+  }
+);

src/main/java/challenges/c20201001_20201007/CombinationSum/solution.ts

@@ -1,3 +1 @@
-function combinationSum(candidates: number[], target: number): number[][] {
-
-};
+function combinationSum(candidates: number[], target: number): number[][] {}

src/main/java/challenges/c20201001_20201007/NumberOfRecentCalls/code.js

@@ -1,17 +1,12 @@
+var RecentCounter = function () {};
 
-var RecentCounter = function() {
-
-};
-
-/** 
+/**
  * @param {number} t
  * @return {number}
  */
-RecentCounter.prototype.ping = function(t) {
-
-};
+RecentCounter.prototype.ping = function (t) {};
 
-/** 
+/**
  * Your RecentCounter object will be instantiated and called as such:
  * var obj = new RecentCounter()
  * var param_1 = obj.ping(t)

src/main/java/challenges/c20201001_20201007/NumberOfRecentCalls/code.ts

@@ -1,16 +1,11 @@
 class RecentCounter {
-    constructor() {
+  constructor() {}
 
-    }
-
-    ping(t: number): number {
-
-    }
+  ping(t: number): number {}
 }
 
 /**
  * Your RecentCounter object will be instantiated and called as such:
  * var obj = new RecentCounter()
  * var param_1 = obj.ping(t)
  */
-

src/main/java/challenges/c20210101_20210107/CheckArrayFormationThroughConcatenation/solution.js

@@ -1,8 +1,8 @@
-/**
- * @param {number[]} arr
- * @param {number[][]} pieces
- * @return {boolean}
- */
-var canFormArray = function(arr, pieces) {
-    return false;
-};
+/**
+ * @param {number[]} arr
+ * @param {number[][]} pieces
+ * @return {boolean}
+ */
+var canFormArray = function (arr, pieces) {
+  return false;
+};

src/main/java/challenges/c20210101_20210107/CheckArrayFormationThroughConcatenation/solution.ts

@@ -1,3 +1,3 @@
-function canFormArray(arr: number[], pieces: number[][]): boolean {
-    return false;
-};
+function canFormArray(arr: number[], pieces: number[][]): boolean {
+  return false;
+}

src/main/java/challenges/c20210101_20210107/FindACorrespondingNodeOfABinaryTreeInACloneOfThatTree/solution.js

@@ -1,17 +1,15 @@
-/**
- * Definition for a binary tree node.
- * function TreeNode(val) {
- *     this.val = val;
- *     this.left = this.right = null;
- * }
- */
-/**
- * @param {TreeNode} original
- * @param {TreeNode} cloned
- * @param {TreeNode} target
- * @return {TreeNode}
- */
-
-var getTargetCopy = function(original, cloned, target) {
-
-};
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} original
+ * @param {TreeNode} cloned
+ * @param {TreeNode} target
+ * @return {TreeNode}
+ */
+
+var getTargetCopy = function (original, cloned, target) {};

src/main/java/challenges/c20210101_20210107/FindACorrespondingNodeOfABinaryTreeInACloneOfThatTree/solution.ts

@@ -1,17 +1,19 @@
-/**
- * Definition for a binary tree node.
- * class TreeNode {
- *     val: number
- *     left: TreeNode | null
- *     right: TreeNode | null
- *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
- *         this.val = (val===undefined ? 0 : val)
- *         this.left = (left===undefined ? null : left)
- *         this.right = (right===undefined ? null : right)
- *     }
- * }
- */
-
-function getTargetCopy(original: TreeNode | null, cloned: TreeNode | null, target: TreeNode | null): TreeNode | null {
-
-};
+/**
+ * Definition for a binary tree node.
+ * class TreeNode {
+ *     val: number
+ *     left: TreeNode | null
+ *     right: TreeNode | null
+ *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.left = (left===undefined ? null : left)
+ *         this.right = (right===undefined ? null : right)
+ *     }
+ * }
+ */
+
+function getTargetCopy(
+  original: TreeNode | null,
+  cloned: TreeNode | null,
+  target: TreeNode | null
+): TreeNode | null {}

src/main/java/problems/easy/ClimbingStairs/climbing_stairs.js

@@ -2,21 +2,21 @@
  * @param {number} n
  * @return {number}
  */
-var climbStairs = function(n) {
-    if (1 == n) {
-        return 1;
-    }
-    if (2 == n) {
-        return 2;
-    }
-    // let values = new Array(n);
-    let values = Array(n).fill(-1);
-    values[0] = 1;
-    values[1] = 2;
-    for (let i = 2; i < n; i++) {
-        values[i] = values[i - 1] + values[i - 2];
-    }
-    return values[n - 1];
+var climbStairs = function (n) {
+  if (1 == n) {
+    return 1;
+  }
+  if (2 == n) {
+    return 2;
+  }
+  // let values = new Array(n);
+  let values = Array(n).fill(-1);
+  values[0] = 1;
+  values[1] = 2;
+  for (let i = 2; i < n; i++) {
+    values[i] = values[i - 1] + values[i - 2];
+  }
+  return values[n - 1];
 };
 
-module.exports = { climbStairs };
+module.exports = { climbStairs };

src/main/java/problems/easy/ClimbingStairs/climbing_stairs.test.js

@@ -1,13 +1,13 @@
 const { climbStairs } = require("./climbing_stairs");
 
 describe.each([
-    [1, 1],
-    [2, 2],
-    [3, 3],
-    [4, 5],
-    [5, 8],
+  [1, 1],
+  [2, 2],
+  [3, 3],
+  [4, 5],
+  [5, 8],
 ])("climbStairs(%i) should equal %i", (input, expectedResult) => {
-    test(`input = {input}, returns = {expectedResult}`, () => {
-        expect(climbStairs(input)).toEqual(expectedResult);
-    });
-});
+  test(`input = {input}, returns = {expectedResult}`, () => {
+    expect(climbStairs(input)).toEqual(expectedResult);
+  });
+});

src/main/java/problems/easy/DegreeOfAnArray/degree_of_an_array.js

@@ -1,9 +1,9 @@
-/**
- * @param {number[]} nums
- * @return {number}
- */
-var findShortestSubArray = function(nums) {
-    return 0;
-};
-
-module.exports = { findShortestSubArray };
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findShortestSubArray = function (nums) {
+  return 0;
+};
+
+module.exports = { findShortestSubArray };

src/main/java/problems/easy/DegreeOfAnArray/degree_of_an_array.test.js

@@ -1,14 +1,10 @@
-const { findShortestSubArray } = require("./degree_of_an_array");
-
-describe.each([
-    [
-        [1, 2, 2, 3, 1], 2
-    ],
-    [
-        [1, 2, 2, 3, 1, 4, 2], 6
-    ],
-])("findShortestSubArray(%o) should equal %i", (inputArray, expectedResult) => {
-    test(`inputArray = {inputArray} returns {expectedResult}`, () => {
-        expect(findShortestSubArray(inputArray)).toEqual(expectedResult);
-    });
-});
+const { findShortestSubArray } = require("./degree_of_an_array");
+
+describe.each([
+  [[1, 2, 2, 3, 1], 2],
+  [[1, 2, 2, 3, 1, 4, 2], 6],
+])("findShortestSubArray(%o) should equal %i", (inputArray, expectedResult) => {
+  test(`inputArray = {inputArray} returns {expectedResult}`, () => {
+    expect(findShortestSubArray(inputArray)).toEqual(expectedResult);
+  });
+});

src/main/java/problems/easy/DegreeOfAnArray/degree_of_an_array.ts

@@ -1,3 +1,3 @@
-function findShortestSubArray(nums: number[]): number {
-    return 0;
-};
+function findShortestSubArray(nums: number[]): number {
+  return 0;
+}