From 94e5b93a82242453b117ed5e308aac2e6c7af2c3 Mon Sep 17 00:00:00 2001
From: Tarawally <41825140+Tarawally@users.noreply.github.com>
Date: Fri, 21 Nov 2025 18:52:58 +0000
Subject: [PATCH 01/10] fix: correct median calculation and input handling

---
 Sprint-1/fix/median.js | 32 +++++++++++++++++++++++++++++---
 1 file changed, 29 insertions(+), 3 deletions(-)

diff --git a/Sprint-1/fix/median.js b/Sprint-1/fix/median.js
index b22590bc6..9a3348c1a 100644
--- a/Sprint-1/fix/median.js
+++ b/Sprint-1/fix/median.js
@@ -6,9 +6,35 @@
 // or 'list' has mixed values (the function is expected to sort only numbers).
 
 function calculateMedian(list) {
-  const middleIndex = Math.floor(list.length / 2);
-  const median = list.splice(middleIndex, 1)[0];
-  return median;
+  // Check if the input is an array, if not return null
+  if (!Array.isArray(list)) {
+    return null;
+  }
+
+  // Filter the list to keep only numbers
+  // We use 'filter' to create a new array with only numeric values
+  const numericList = list.filter((item) => typeof item === "number");
+
+  // If there are no numbers, return null
+  if (numericList.length === 0) {
+    return null;
+  }
+
+  // Sort the numbers in ascending order
+  // We provide a compare function to ensure numerical sorting, not alphabetical
+  numericList.sort((a, b) => a - b);
+
+  const length = numericList.length;
+  const middleIndex = Math.floor(length / 2);
+
+  // Check if the list has an odd number of elements
+  if (length % 2 !== 0) {
+    // If odd, return the middle element
+    return numericList[middleIndex];
+  } else {
+    // If even, calculate the average of the two middle elements
+    return (numericList[middleIndex - 1] + numericList[middleIndex]) / 2;
+  }
 }
 
 module.exports = calculateMedian;

From 985bb200496dc8fc5ca65be21438017bd586dcdf Mon Sep 17 00:00:00 2001
From: Tarawally <41825140+Tarawally@users.noreply.github.com>
Date: Sat, 22 Nov 2025 11:30:11 +0000
Subject: [PATCH 02/10] fix: correct median calculation and input handling

---
 Sprint-1/fix/median.js | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Sprint-1/fix/median.js b/Sprint-1/fix/median.js
index 9a3348c1a..9980d64c9 100644
--- a/Sprint-1/fix/median.js
+++ b/Sprint-1/fix/median.js
@@ -11,17 +11,17 @@ function calculateMedian(list) {
     return null;
   }
 
-  // Filter the list to keep only numbers
-  // We use 'filter' to create a new array with only numeric values
+  // Filter the list to keep only numbers.
+  // `filter` creates a new array with only numeric values.
   const numericList = list.filter((item) => typeof item === "number");
 
-  // If there are no numbers, return null
+  // If there are no numbers, return null.
   if (numericList.length === 0) {
     return null;
   }
 
-  // Sort the numbers in ascending order
-  // We provide a compare function to ensure numerical sorting, not alphabetical
+  // Sort the numbers in ascending order.
+  // `sort` ensure numerical sorting, not alphabetical.
   numericList.sort((a, b) => a - b);
 
   const length = numericList.length;

From 2d63e11ab7df12a7f1c852a73542231e950aef79 Mon Sep 17 00:00:00 2001
From: Tarawally <41825140+Tarawally@users.noreply.github.com>
Date: Sat, 22 Nov 2025 11:46:29 +0000
Subject: [PATCH 03/10] fix: correct median calculation and input handling

---
 Sprint-1/fix/median.js | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Sprint-1/fix/median.js b/Sprint-1/fix/median.js
index 9980d64c9..372a7d8c4 100644
--- a/Sprint-1/fix/median.js
+++ b/Sprint-1/fix/median.js
@@ -27,12 +27,12 @@ function calculateMedian(list) {
   const length = numericList.length;
   const middleIndex = Math.floor(length / 2);
 
-  // Check if the list has an odd number of elements
+  // Check if the list has an odd number of elements.
   if (length % 2 !== 0) {
-    // If odd, return the middle element
+    // If odd, return the middle element.
     return numericList[middleIndex];
   } else {
-    // If even, calculate the average of the two middle elements
+    // If even, calculate the average of the two middle elements.
     return (numericList[middleIndex - 1] + numericList[middleIndex]) / 2;
   }
 }

From 1d83f96459c1006ebb96a1b7ee3b3e0f39715abb Mon Sep 17 00:00:00 2001
From: Tarawally <41825140+Tarawally@users.noreply.github.com>
Date: Mon, 24 Nov 2025 00:15:47 +0000
Subject: [PATCH 04/10] feat: implement dedupe function to remove duplicates
 from arrays

---
 Sprint-1/implement/dedupe.js      | 22 +++++++++++++++++++++-
 Sprint-1/implement/dedupe.test.js | 14 +++++++++++++-
 2 files changed, 34 insertions(+), 2 deletions(-)

diff --git a/Sprint-1/implement/dedupe.js b/Sprint-1/implement/dedupe.js
index 781e8718a..50b0a8d0a 100644
--- a/Sprint-1/implement/dedupe.js
+++ b/Sprint-1/implement/dedupe.js
@@ -1 +1,21 @@
-function dedupe() {}
+function dedupe(arr) {
+  // Check if the input is an array; if not, throw a TypeError.
+  if (!Array.isArray(arr)) {
+    throw new TypeError("Input must be an array");
+  }
+
+  // If the array is empty, return an empty array.
+  if (arr.length === 0) {
+    return [];
+  }
+
+  // Use a Set to keep unique values.
+  // A Set is a collection of unique values, so duplicates are removed automatically.
+  const uniqueSet = new Set(arr);
+
+  // Change the Set back to an array.
+  // `Array.from` makes a new array of unique values, not the original array.
+  return Array.from(uniqueSet);
+}
+
+module.exports = dedupe;
diff --git a/Sprint-1/implement/dedupe.test.js b/Sprint-1/implement/dedupe.test.js
index 23e0f8638..1ec76d995 100644
--- a/Sprint-1/implement/dedupe.test.js
+++ b/Sprint-1/implement/dedupe.test.js
@@ -16,12 +16,24 @@ E.g. dedupe([1, 2, 1]) target output: [1, 2]
 // Given an empty array
 // When passed to the dedupe function
 // Then it should return an empty array
-test.todo("given an empty array, it returns an empty array");
+test("given an empty array, it returns an empty array", () => {
+  expect(dedupe([])).toEqual([]);
+});
 
 // Given an array with no duplicates
 // When passed to the dedupe function
 // Then it should return a copy of the original array
+test("given an array with no duplicates, returns copy of original array", () => {
+  const input = [1, 2, 3, "d", "e", "f"];
+  const result = dedupe(input);
+  expect(result).toEqual(input);
+  expect(result).not.toBe(input); // Ensure it's a different array (a copy)
+});
 
 // Given an array with strings or numbers
 // When passed to the dedupe function
 // Then it should remove the duplicate values, preserving the first occurence of each element
+test("given an array with duplicates, removes them preserving order", () => {
+  expect(dedupe(["a", "a", "a", "b", "b", "c"])).toEqual(["a", "b", "c"]);
+  expect(dedupe([5, 1, 1, 2, 3, 2, 5, 8])).toEqual([5, 1, 2, 3, 8]);
+});

From c9375ca18fd91e3ecfde9f4afb6705dc250df1f0 Mon Sep 17 00:00:00 2001
From: Tarawally <41825140+Tarawally@users.noreply.github.com>
Date: Mon, 24 Nov 2025 01:06:25 +0000
Subject: [PATCH 05/10] feat: implement findMax function and add comprehensive
 tests

---
 Sprint-1/implement/max.js      | 21 +++++++++++++++++++++
 Sprint-1/implement/max.test.js | 24 +++++++++++++++++++++++-
 2 files changed, 44 insertions(+), 1 deletion(-)

diff --git a/Sprint-1/implement/max.js b/Sprint-1/implement/max.js
index 6dd76378e..0a10907ca 100644
--- a/Sprint-1/implement/max.js
+++ b/Sprint-1/implement/max.js
@@ -1,4 +1,25 @@
 function findMax(elements) {
+  // Check if the input is an array; if not, throw a TypeError.
+  if (!Array.isArray(elements)) {
+    throw new TypeError("Input must be an array");
+  }
+
+  // If the array is empty, return return -Infinity.
+  if (elements.length === 0) {
+    return -Infinity;
+  }
+
+  // Filter the array to keep only numbers
+  const numbers = elements.filter((item) => typeof item === "number");
+
+  // If there are no numbers in the array, return -Infinity
+  if (numbers.length === 0) {
+    return -Infinity;
+  }
+
+  // Use Math.max with the spread operator to find the maximum number
+  // This is an efficient way to find the largest value in an array
+  return Math.max(...numbers);
 }
 
 module.exports = findMax;
diff --git a/Sprint-1/implement/max.test.js b/Sprint-1/implement/max.test.js
index 82f18fd88..682f94dc0 100644
--- a/Sprint-1/implement/max.test.js
+++ b/Sprint-1/implement/max.test.js
@@ -16,28 +16,50 @@ const findMax = require("./max.js");
 // When passed to the max function
 // Then it should return -Infinity
 // Delete this test.todo and replace it with a test.
-test.todo("given an empty array, returns -Infinity");
+test("given an empty array, returns -Infinity", () => {
+  expect(findMax([])).toBe(-Infinity);
+});
 
 // Given an array with one number
 // When passed to the max function
 // Then it should return that number
+test("given an array with one number, returns that number", () => {
+  expect(findMax([10])).toBe(10);
+});
 
 // Given an array with both positive and negative numbers
 // When passed to the max function
 // Then it should return the largest number overall
+test("given an array with positive and negative numbers, returns the largest number", () => {
+  expect(findMax([10, -5, 20, -10])).toBe(20);
+});
 
 // Given an array with just negative numbers
 // When passed to the max function
 // Then it should return the closest one to zero
+test("given an array with just negative numbers, returns the closest to zero", () => {
+  expect(findMax([-10, -5, -20])).toBe(-5);
+});
 
 // Given an array with decimal numbers
 // When passed to the max function
 // Then it should return the largest decimal number
+test("given an array with decimal numbers, returns the largest decimal", () => {
+  expect(findMax([10.5, 207.1145, 99.9])).toBe(207.1145);
+});
 
 // Given an array with non-number values
 // When passed to the max function
 // Then it should return the max and ignore non-numeric values
+test("given an array with non-number values, ignores them and returns max", () => {
+  expect(findMax(["yo", 10, "sup", 60, 10])).toBe(60);
+});
 
 // Given an array with only non-number values
 // When passed to the max function
 // Then it should return the least surprising value given how it behaves for all other inputs
+test("given an array with only non-number values, returns -Infinity", () => {
+  expect(
+    findMax(["a", "b", "c", "null", "undefined", "true", "false", ""])
+  ).toBe(-Infinity);
+});

From 41a3b16d41678e75541a53634bc536955103f9b0 Mon Sep 17 00:00:00 2001
From: Tarawally <41825140+Tarawally@users.noreply.github.com>
Date: Mon, 24 Nov 2025 13:05:29 +0000
Subject: [PATCH 06/10] feat: implement sum function to add only numbers in an
 array

---
 Sprint-1/implement/sum.js      | 20 ++++++++++++++++++++
 Sprint-1/implement/sum.test.js | 19 ++++++++++++++++++-
 2 files changed, 38 insertions(+), 1 deletion(-)

diff --git a/Sprint-1/implement/sum.js b/Sprint-1/implement/sum.js
index 9062aafe3..46dd59740 100644
--- a/Sprint-1/implement/sum.js
+++ b/Sprint-1/implement/sum.js
@@ -1,4 +1,24 @@
 function sum(elements) {
+  // Check if the input is an array; if not, throw a TypeError.
+  if (!Array.isArray(elements)) {
+    throw new TypeError("Input must be an array");
+  }
+
+  // If the array is empty, return 0.
+  if (elements.length === 0) {
+    return 0;
+  }
+
+  // Filter the array to keep only numbers
+  const numbers = elements.filter((item) => typeof item === "number");
+
+  // Calculate the sum of the numbers using a for loop
+  let total = 0;
+
+  for (const item of numbers) {
+    total += item;
+  }
+  return total;
 }
 
 module.exports = sum;
diff --git a/Sprint-1/implement/sum.test.js b/Sprint-1/implement/sum.test.js
index dd0a090ca..8050e3f08 100644
--- a/Sprint-1/implement/sum.test.js
+++ b/Sprint-1/implement/sum.test.js
@@ -13,24 +13,41 @@ const sum = require("./sum.js");
 // Given an empty array
 // When passed to the sum function
 // Then it should return 0
-test.todo("given an empty array, returns 0")
+test("given an empty array, returns 0", () => {
+  expect(sum([])).toBe(0);
+});
 
 // Given an array with just one number
 // When passed to the sum function
 // Then it should return that number
+test("given an array with one number, returns that number", () => {
+  expect(sum([10])).toBe(10);
+});
 
 // Given an array containing negative numbers
 // When passed to the sum function
 // Then it should still return the correct total sum
+test("given an array containing negative numbers, returns correct sum", () => {
+  expect(sum([10, -5, 20])).toBe(25);
+});
 
 // Given an array with decimal/float numbers
 // When passed to the sum function
 // Then it should return the correct total sum
+test("given an array with decimal numbers, returns correct sum", () => {
+  expect(sum([10.5, 20.5])).toBe(31);
+});
 
 // Given an array containing non-number values
 // When passed to the sum function
 // Then it should ignore the non-numerical values and return the sum of the numerical elements
+test("given an array with non-number values, ignores them and returns sum", () => {
+  expect(sum(["yo", 10, "sup", 60, 10, ":)"])).toBe(80);
+});
 
 // Given an array with only non-number values
 // When passed to the sum function
 // Then it should return the least surprising value given how it behaves for all other inputs
+test("given an array with only non-number values, returns 0", () => {
+  expect(sum(["a", "b", "c","``","//","", null])).toBe(0);
+});

From 193999c63c26c5061fe2142a08aed0a485f63ccb Mon Sep 17 00:00:00 2001
From: Tarawally <41825140+Tarawally@users.noreply.github.com>
Date: Mon, 24 Nov 2025 13:17:16 +0000
Subject: [PATCH 07/10] refactor: update includes function to use for...of loop

---
 Sprint-1/refactor/includes.js | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/Sprint-1/refactor/includes.js b/Sprint-1/refactor/includes.js
index 29dad81f0..de7330d24 100644
--- a/Sprint-1/refactor/includes.js
+++ b/Sprint-1/refactor/includes.js
@@ -1,12 +1,14 @@
 // Refactor the implementation of includes to use a for...of loop
 
 function includes(list, target) {
-  for (let index = 0; index < list.length; index++) {
-    const element = list[index];
+  for (const element of list) {
+    // Check if the current element matches the target
     if (element === target) {
       return true;
     }
   }
+
+  // Return false if the target is not found in the list
   return false;
 }
 

From a0a8257f70cc8ad46d07e07f2895823df40da232 Mon Sep 17 00:00:00 2001
From: Tarawally <41825140+Tarawally@users.noreply.github.com>
Date: Mon, 24 Nov 2025 13:26:35 +0000
Subject: [PATCH 08/10] chore: update package-lock.json to match current
 dependencies

---
 Sprint-1/package-lock.json | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Sprint-1/package-lock.json b/Sprint-1/package-lock.json
index 83e427d0b..b52480af5 100644
--- a/Sprint-1/package-lock.json
+++ b/Sprint-1/package-lock.json
@@ -56,6 +56,7 @@
       "integrity": "sha512-Oixnb+DzmRT30qu9d3tJSQkxuygWm32DFykT4bRoORPa9hZ/L4KhVB/XiRm6KG+roIEM7DBQlmg27kw2HZkdZg==",
       "dev": true,
       "license": "MIT",
+      "peer": true,
       "dependencies": {
         "@ampproject/remapping": "^2.2.0",
         "@babel/code-frame": "^7.25.7",
@@ -1368,6 +1369,7 @@
         }
       ],
       "license": "MIT",
+      "peer": true,
       "dependencies": {
         "caniuse-lite": "^1.0.30001663",
         "electron-to-chromium": "^1.5.28",

From 2a9b3af342398556af771a5085add37f020258ea Mon Sep 17 00:00:00 2001
From: Tarawally <41825140+Tarawally@users.noreply.github.com>
Date: Mon, 24 Nov 2025 13:27:13 +0000
Subject: [PATCH 09/10] chore: add devcontainer.json for development
 environment

---
 .devcontainer/devcontainer.json | 31 +++++++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 .devcontainer/devcontainer.json

diff --git a/.devcontainer/devcontainer.json b/.devcontainer/devcontainer.json
new file mode 100644
index 000000000..5697a562c
--- /dev/null
+++ b/.devcontainer/devcontainer.json
@@ -0,0 +1,31 @@
+// Docker rootless development container
+{
+    "name": "Code-Your-Future",
+    "image": "debian:latest",
+    "features": {
+        "ghcr.io/devcontainers/features/common-utils:2": {
+            "installZsh": true,
+            "upgradePackages": true
+        },
+        "ghcr.io/devcontainers/features/node:1": {
+            "version": "lts"
+        },
+        "ghcr.io/devcontainers/features/github-cli:1": {}
+    },
+    "customizations" : {
+        "vscode" : {
+            "settings": {
+                "terminal.integrated.defaultProfile.linux": "zsh"
+            },
+            "extensions": [
+                    "esbenp.prettier-vscode",
+                    "dbaeumer.vscode-eslint",
+                    "streetsidesoftware.code-spell-checker",
+                    "eamodio.gitlens",
+                    "ritwickdey.LiveServer",
+                    "vsliveshare.vsliveshare",
+                    "Orta.vscode-jest"
+            ]
+        }
+    }
+}
\ No newline at end of file

From d1486d7e1cd16e52124966068acf09b7a5f31058 Mon Sep 17 00:00:00 2001
From: Tarawally <41825140+Tarawally@users.noreply.github.com>
Date: Mon, 24 Nov 2025 13:44:37 +0000
Subject: [PATCH 10/10] chore: reformat median.test.js to conform to Prettier
 code style

---
 Sprint-1/fix/median.test.js | 22 +++++++++++++++++-----
 1 file changed, 17 insertions(+), 5 deletions(-)

diff --git a/Sprint-1/fix/median.test.js b/Sprint-1/fix/median.test.js
index 21da654d7..c262c3776 100644
--- a/Sprint-1/fix/median.test.js
+++ b/Sprint-1/fix/median.test.js
@@ -13,7 +13,8 @@ describe("calculateMedian", () => {
     { input: [1, 2, 3, 4], expected: 2.5 },
     { input: [1, 2, 3, 4, 5, 6], expected: 3.5 },
   ].forEach(({ input, expected }) =>
-    it(`returns the median for [${input}]`, () => expect(calculateMedian(input)).toEqual(expected))
+    it(`returns the median for [${input}]`, () =>
+      expect(calculateMedian(input)).toEqual(expected))
   );
 
   [
@@ -24,7 +25,8 @@ describe("calculateMedian", () => {
     { input: [110, 20, 0], expected: 20 },
     { input: [6, -2, 2, 12, 14], expected: 6 },
   ].forEach(({ input, expected }) =>
-    it(`returns the correct median for unsorted array [${input}]`, () => expect(calculateMedian(input)).toEqual(expected))
+    it(`returns the correct median for unsorted array [${input}]`, () =>
+      expect(calculateMedian(input)).toEqual(expected))
   );
 
   it("doesn't modify the input array [3, 1, 2]", () => {
@@ -33,8 +35,17 @@ describe("calculateMedian", () => {
     expect(list).toEqual([3, 1, 2]);
   });
 
-  [ 'not an array', 123, null, undefined, {}, [], ["apple", null, undefined] ].forEach(val =>
-    it(`returns null for non-numeric array (${val})`, () => expect(calculateMedian(val)).toBe(null))
+  [
+    "not an array",
+    123,
+    null,
+    undefined,
+    {},
+    [],
+    ["apple", null, undefined],
+  ].forEach((val) =>
+    it(`returns null for non-numeric array (${val})`, () =>
+      expect(calculateMedian(val)).toBe(null))
   );
 
   [
@@ -45,6 +56,7 @@ describe("calculateMedian", () => {
     { input: [3, "apple", 1, null, 2, undefined, 4], expected: 2.5 },
     { input: ["banana", 5, 3, "apple", 1, 4, 2], expected: 3 },
   ].forEach(({ input, expected }) =>
-    it(`filters out non-numeric values and calculates the median for [${input}]`, () => expect(calculateMedian(input)).toEqual(expected))
+    it(`filters out non-numeric values and calculates the median for [${input}]`, () =>
+      expect(calculateMedian(input)).toEqual(expected))
   );
 });