freecodecamp problem #1 solved with brute force

Author: Gabrieldev-web-coder

Search algorithms/sumTwoNumbers.test.js

@@ -1,20 +1,20 @@
-const searchNumbers = require("../Search algorithms/sumTwoNumbers.js");
+// const searchNumbers = require("../Search algorithms/sumTwoNumbers.js");
 
-test("Test #1", () => {
-  expect(searchNumbers([-3, 4, 3, 90], 0)).toStrictEqual([0, 2]);
-});
+// test("Test #1", () => {
+//   expect(searchNumbers([-3, 4, 3, 90], 0)).toStrictEqual([0, 2]);
+// });
 
-test("Test #2", () => {
-  expect(searchNumbers([2, 7, 11, 15], 9)).toStrictEqual([0, 1]);
-});
+// test("Test #2", () => {
+//   expect(searchNumbers([2, 7, 11, 15], 9)).toStrictEqual([0, 1]);
+// });
 
-test("Test #3", () => {
-  expect(searchNumbers([3, 2, 4], 6)).toStrictEqual([1, 2]);
-});
+// test("Test #3", () => {
+//   expect(searchNumbers([3, 2, 4], 6)).toStrictEqual([1, 2]);
+// });
 
-test("Test #4", () => {
-  expect(searchNumbers([3, 3], 6)).toStrictEqual([0, 1]);
-});
+// test("Test #4", () => {
+//   expect(searchNumbers([3, 3], 6)).toStrictEqual([0, 1]);
+// });
 
 // const arr = [-3, 4, 3, 90];  target = 0;
 

freecodecamp/chunkArrayInGroups.js

@@ -1,4 +1,19 @@
 function chunkArrayInGroups(arr, size) {
-  return arr;
+  //Brute force solution...
+  const subArrays = [];
+
+  while (arr.length > 0) {
+    // 0(n)
+    const subArr = arr.splice(0, size); // splice method is 0(n)
+    if (subArr.length !== 0) {
+      subArrays[subArrays.length] = subArr;
+    }
+  }
+  return subArrays;
 }
-chunkArrayInGroups(["a", "b", "c", "d"], 2);
+
+//Therefore, this algorithm is 0(n2)
+
+console.log(chunkArrayInGroups(["a", "b", "c", "d"], 2));
+
+module.exports = chunkArrayInGroups;

freecodecamp/chunkArrayInGroups.test.js

@@ -0,0 +1,56 @@
+const chunkArrayInGroups = require("../freecodecamp/chunkArrayInGroups.js");
+
+test("Test #1", () => {
+  expect(chunkArrayInGroups(["a", "b", "c", "d"], 2)).toStrictEqual([
+    ["a", "b"],
+    ["c", "d"],
+  ]);
+});
+
+test("Test #2", () => {
+  expect(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 3)).toStrictEqual([
+    [0, 1, 2],
+    [3, 4, 5],
+  ]);
+});
+
+test("Test #3", () => {
+  expect(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 2)).toStrictEqual([
+    [0, 1],
+    [2, 3],
+    [4, 5],
+  ]);
+});
+
+test("Test #4", () => {
+  expect(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 4)).toStrictEqual([
+    [0, 1, 2, 3],
+    [4, 5],
+  ]);
+});
+
+test("Test #5", () => {
+  expect(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6], 3)).toStrictEqual([
+    [0, 1, 2],
+    [3, 4, 5],
+    [6],
+  ]);
+});
+
+test("Test #6", () => {
+  expect(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 2)).toStrictEqual([
+    [0, 1],
+    [2, 3],
+    [4, 5],
+    [6, 7],
+    [8],
+  ]);
+});
+
+test("Test #7", () => {
+  expect(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 4)).toStrictEqual([
+    [0, 1, 2, 3],
+    [4, 5, 6, 7],
+    [8],
+  ]);
+});