Remove legacy tasks from the old js2 module and add correct ones

Author: pseudopilot

Sprint-1/fix/median.js

@@ -0,0 +1,11 @@
+// Fix this implementation
+// Start by running the tests for this function
+// If you're in the week-1 directory, you can run npm test -- fix to run the tests in the fix directory
+
+function calculateMedian(list) {
+  const middleIndex = Math.floor(list.length / 2);
+  const median = list.splice(middleIndex, 1)[0];
+  return median;
+}
+
+module.exports = calculateMedian;

Sprint-1/fix/median.test.js

@@ -0,0 +1,26 @@
+// median.test.js
+
+// Someone has implemented calculateMedian but it isn't
+// passing all the tests...
+// Fix the implementation of calculateMedian so it passes all tests
+
+const calculateMedian = require("./median.js");
+
+describe("calculateMedian", () => {
+  test("returns the median for odd length array", () => {
+    expect(calculateMedian([1, 2, 3])).toBe(2);
+    expect(calculateMedian([1, 2, 3, 4, 5])).toBe(3);
+  });
+
+  test("returns the average of middle values for even length array", () => {
+    expect(calculateMedian([1, 2, 3, 4])).toBe(2.5);
+    expect(calculateMedian([1, 2, 3, 4, 5, 6])).toBe(3.5);
+  });
+
+  test("doesn't modify the input", () => {
+    const list = [1, 2, 3];
+    calculateMedian(list);
+
+    expect(list).toEqual([1, 2, 3]);
+  });
+});

Sprint-1/implement/dedupe.js

@@ -0,0 +1 @@
+function dedupe() {}

Sprint-1/implement/dedupe.test.js

@@ -0,0 +1,26 @@
+const dedupe = require("./dedupe.js");
+/*
+Dedupe Array
+
+📖 Dedupe means **deduplicate**
+
+In this kata, you will need to deduplicate the elements of an array
+
+E.g. dedupe(['a','a','a','b','b','c']) target output: ['a','b','c']
+E.g. dedupe([5, 1, 1, 2, 3, 2, 5, 8]) target output: [5, 1, 2, 3, 8]
+*/
+
+// Acceptance Criteria:
+
+// 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");
+
+// Given an array with no duplicates
+// When passed to the dedupe function
+// Then it should return a copy of the original array
+
+// Given an array with strings or numbers
+// When passed to the dedupe function
+// Then it should remove the duplicate values

journey-planner/readme.md renamed to Sprint-1/implement/max.js

@@ -0,0 +1,28 @@
+/* Find the maximum element of an array of numbers
+
+In this kata, you will need to implement a function that sums the numerical elements of an array
+
+E.g. max([30, 50, 10, 40]), target output: 50
+E.g. max(['hey', 10, 'hi', 60, 10]), target output: 60 (sum ignores any non-numerical elements)
+*/
+
+// Given an empty array
+// When passed to the max function
+// Then it should return -Infinity
+test.todo("given an empty array, returns -Infinity");
+
+// Given an array with one number
+// When passed to the max function
+// Then it should return that number
+
+// Given an array with both positive and negative numbers
+// When passed to the max function
+// Then it should return the largest number overall
+
+// Given an array with decimal numbers
+// When passed to the max function
+// Then it should return the largest decimal number
+
+// Given an array with non-number values
+// When passed to the max function
+// Then it should return the max and ignore non-numeric values

Sprint-1/implement/max.test.js

@@ -0,0 +1,29 @@
+/* Sum the numbers in an array
+
+In this kata, you will need to implement a function that sums the numerical elements of an array
+
+E.g. sum([10, 20, 30]), target output: 60
+E.g. sum(['hey', 10, 'hi', 60, 10]), target output: 80 (ignore any non-numerical elements)
+*/
+
+// Acceptance Criteria:
+
+// Given an empty array
+// When passed to the sum function
+// Then it should return 0
+
+// Given an array with just one number
+// When passed to the sum function
+// Then it should return that number
+
+// Given an array containing negative numbers
+// When passed to the sum function
+// Then it should still return the correct total sum
+
+// Given an array with decimal/float numbers
+// When passed to the sum function
+// Then it should return the correct total sum
+
+// 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

mini-twitter/index.html renamed to Sprint-1/implement/sum.js

@@ -0,0 +1,15 @@
+{
+  "name": "week-1",
+  "version": "1.0.0",
+  "description": "This README will guide you through the different sections for this week.",
+  "main": "writers.js",
+  "scripts": {
+    "test": "jest"
+  },
+  "keywords": [],
+  "author": "",
+  "license": "ISC",
+  "devDependencies": {
+    "jest": "^29.7.0"
+  }
+}

Sprint-1/implement/sum.test.js

@@ -0,0 +1,45 @@
+# 🧭 Guide to Week 1 exercises
+
+This README will guide you through the different sections for this week.
+
+## Setup
+
+Go to the **root of this repository**. Double check you're there with `pwd`. Also double check with `ls`.
+**If you're in the root you should be able to see the `week-1`, `week-2` and `week-3` directories**
+
+Run the command `npm install` in the root of this repo.
+
+To run tests in the `week-1` directory you can:
+
+1. Change directory into `week-1`
+2. Run the tests using `npm test`
+
+## Fix
+
+In this section, you'll have a function and some tests. The function isn't working for all the tests - you'll need to:
+
+- run the tests
+- interpret the test feedback
+- fix the tests
+
+To run the tests for the `fix` directory you can `cd` into `week-1` and run `npm test -- fix`.
+
+## 🔨 Implement
+
+In this section, you will have a short set of requirements about a function. You will need to implement a function based off this set of requirements. Make sure you check your function works for a number of different inputs.
+
+Here is a recommended order:
+
+1. `max.test.js`
+2. `sum.test.js`
+3. `dedupe.test.js`
+
+## 🧹 Refactor
+
+In these problems, you'll be given an implementation and then asked to change it. Once you've updated the implementations you'll need to double check that they are still working!
+
+Once you've completed all these tasks, raise a PR with your work so far. Don't wait to complete your coursework before completing the PR.
+
+## Stretch 💪
+
+Try the more challenging problem from Advent of Code!