feat(curriculum): daily challenges 213-222 (freeCodeCamp#66191)

Co-authored-by: majestic-owl448 <26656284+majestic-owl448@users.noreply.github.com>
Co-authored-by: Sem Bauke <sem@freecodecamp.org>

Author: 3 people

curriculum/challenges/english/blocks/daily-coding-challenges-javascript/697a49e6ff50d756c9b69366.md

@@ -13,7 +13,7 @@ To determine the rating:
 
 - Calculate the steepness of the hill by taking the drop divided by the distance.
 - Then, calculate the adjusted steepness based on the hill type:
-  - `"Downhill"` multiply steepness by 1.2
+  - `"Downhill"`: multiply steepness by 1.2
   - `"Slalom"`: multiply steepness by 0.9
   - `"Giant Slalom"`: multiply steepness by 1.0
 

curriculum/challenges/english/blocks/daily-coding-challenges-javascript/699c8e045ee7cb94ed2322d4.md

@@ -0,0 +1,63 @@
+---
+id: 699c8e045ee7cb94ed2322d4
+title: "Challenge 213: Word Length Converter"
+challengeType: 28
+dashedName: challenge-213
+---
+
+# --description--
+
+Given a string of words, return a new string where each word is replaced by its length.
+
+- Words in the given string will be separated by a single space
+- Keep the spaces in the returned string.
+
+For example, given `"hello world"`, return `"5 5"`.
+
+# --hints--
+
+`convertWords("hello world")` should return `"5 5"`.
+
+```js
+assert.equal(convertWords("hello world"), "5 5");
+```
+
+`convertWords("Thanks and happy coding")` should return `"6 3 5 6"`.
+
+```js
+assert.equal(convertWords("Thanks and happy coding"), "6 3 5 6");
+```
+
+`convertWords("The quick brown fox jumps over the lazy dog")` should return `"3 5 5 3 5 4 3 4 3"`.
+
+```js
+assert.equal(convertWords("The quick brown fox jumps over the lazy dog"), "3 5 5 3 5 4 3 4 3");
+```
+
+`convertWords("Lorem ipsum dolor sit amet consectetur adipiscing elit donec ut ligula vehicula iaculis orci vel semper nisl")` should return `"5 5 5 3 4 11 10 4 5 2 6 8 7 4 3 6 4"`.
+
+```js
+assert.equal(convertWords("Lorem ipsum dolor sit amet consectetur adipiscing elit donec ut ligula vehicula iaculis orci vel semper nisl"), "5 5 5 3 4 11 10 4 5 2 6 8 7 4 3 6 4");
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function convertWords(str) {
+
+  return str;
+}
+```
+
+# --solutions--
+
+```js
+function convertWords(str) {
+  return str
+    .split(" ")
+    .map(word => word.length)
+    .join(" ");
+}
+```

curriculum/challenges/english/blocks/daily-coding-challenges-javascript/699c8e045ee7cb94ed2322d5.md

@@ -0,0 +1,69 @@
+---
+id: 699c8e045ee7cb94ed2322d5
+title: "Challenge 214: Domino Chain Validator"
+challengeType: 28
+dashedName: challenge-214
+---
+
+# --description--
+
+Given a 2D array representing a sequence of dominoes, determine whether it forms a valid chain.
+
+- Each element in the array represents a domino and will be an array of two numbers from 1 to 6, (inclusive).
+- For the chain to be valid, the second number of each domino must match the first number of the next domino.
+- The first number of the first domino and the last number of the last domino don't need to match anything.
+
+# --hints--
+
+`isValidDominoChain([[1, 3], [3, 6], [6, 5]])` should return `true`.
+
+```js
+assert.isTrue(isValidDominoChain([[1, 3], [3, 6], [6, 5]]));
+```
+
+`isValidDominoChain([[6, 2], [3, 4], [4, 1]])` should return `false`.
+
+```js
+assert.isFalse(isValidDominoChain([[6, 2], [3, 4], [4, 1]]));
+```
+
+`isValidDominoChain([[2, 5], [5, 6], [5, 1]])` should return `false`.
+
+```js
+assert.isFalse(isValidDominoChain([[2, 5], [5, 6], [5, 1]]));
+```
+
+`isValidDominoChain([[4, 3], [3, 1], [1, 6], [6, 6], [6, 5], [5, 1], [1, 1], [1, 4], [4, 4], [4, 2]])` should return `true`.
+
+```js
+assert.isTrue(isValidDominoChain([[4, 3], [3, 1], [1, 6], [6, 6], [6, 5], [5, 1], [1, 1], [1, 4], [4, 4], [4, 2]]));
+```
+
+`isValidDominoChain([[2, 3], [3, 3], [3, 6], [6, 1], [1, 4], [3, 5], [5, 5], [5, 4], [4, 2], [2, 2]])` should return `false`.
+
+```js
+assert.isFalse(isValidDominoChain([[2, 3], [3, 3], [3, 6], [6, 1], [1, 4], [3, 5], [5, 5], [5, 4], [4, 2], [2, 2]]));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isValidDominoChain(dominoes) {
+
+  return dominoes;
+}
+```
+
+# --solutions--
+
+```js
+function isValidDominoChain(dominoes) {
+  for (let i = 0; i < dominoes.length - 1; i++) {
+    if (dominoes[i][1] !== dominoes[i+1][0]) return false
+  }
+
+  return true;
+}
+```

curriculum/challenges/english/blocks/daily-coding-challenges-javascript/699c8e045ee7cb94ed2322d6.md

@@ -0,0 +1,109 @@
+---
+id: 699c8e045ee7cb94ed2322d6
+title: "Challenge 215: Parking Fee Calculator"
+challengeType: 28
+dashedName: challenge-215
+---
+
+# --description--
+
+Given two strings representing the time you parked your car and the time you picked it up, calculate the parking fee.
+
+- The given strings will be in the format `"HH:MM"` using a 24-hour clock. So `"14:00"` is 2pm for example.
+- The first string will be the time you parked your car, and the second will be the time you picked it up.
+- If the pickup time is earlier than the entry time, it means the parking spanned past midnight into the next day.
+
+Fee rules:
+
+- Each hour parked costs $3.
+- Partial hours are rounded up to the next full hour.
+- If the parking spans overnight (past midnight), an additional $10 overnight fee is applied.
+- There is a minimum fee of $5 (only used if the total would be less than $5).
+
+Return the total cost in the format `"$cost"`, `"$5"` for example.
+
+# --hints--
+
+`calculateParkingFee("09:00", "11:00")` should return `"$6"`.
+
+```js
+assert.equal(calculateParkingFee("09:00", "11:00"), "$6");
+```
+
+`calculateParkingFee("10:00", "10:30")` should return `"$5"`.
+
+```js
+assert.equal(calculateParkingFee("10:00", "10:30"), "$5");
+```
+
+`calculateParkingFee("08:10", "10:45")` should return `"$9"`.
+
+```js
+assert.equal(calculateParkingFee("08:10", "10:45"), "$9");
+```
+
+`calculateParkingFee("14:40", "23:10")` should return `"$27"`.
+
+```js
+assert.equal(calculateParkingFee("14:40", "23:10"), "$27");
+```
+
+`calculateParkingFee("18:15", "01:30")` should return `"$34"`.
+
+```js
+assert.equal(calculateParkingFee("18:15", "01:30"), "$34");
+```
+
+`calculateParkingFee("11:11", "11:10")` should return `"$82"`.
+
+```js
+assert.equal(calculateParkingFee("11:11", "11:10"), "$82");
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function calculateParkingFee(parkTime, pickupTime) {
+
+  return parkTime;
+}
+```
+
+# --solutions--
+
+```js
+function calculateParkingFee(parkTime, pickupTime) {
+  function toMinutes(time) {
+    const [hours, minutes] = time.split(":").map(Number);
+    return hours * 60 + minutes;
+  }
+
+  const entryMinutes = toMinutes(parkTime);
+  const exitMinutes = toMinutes(pickupTime);
+
+  let totalMinutes;
+  let overnight = false;
+
+  if (exitMinutes < entryMinutes) {
+    overnight = true;
+    totalMinutes = (24 * 60 - entryMinutes) + exitMinutes;
+  } else {
+    totalMinutes = exitMinutes - entryMinutes;
+  }
+
+  const hours = Math.ceil(totalMinutes / 60);
+  let cost = hours * 3;
+
+  if (overnight) {
+    cost += 10;
+  }
+
+  if (cost < 5) {
+    cost = 5;
+  }
+
+  return `$${cost}`;
+}
+```

curriculum/challenges/english/blocks/daily-coding-challenges-javascript/699c8e045ee7cb94ed2322d7.md

@@ -0,0 +1,89 @@
+---
+id: 699c8e045ee7cb94ed2322d7
+title: "Challenge 216: Pi Day"
+challengeType: 28
+dashedName: challenge-216
+---
+
+# --description--
+
+Happy pi (π) day!
+
+Given an integer (`n`), where `n` is between 1 and 1000 (inclusive), return the `n`th decimal of π.
+
+- Make sure to return a number not a string.
+
+π with its first five decimals is 3.14159. So given `5` for example, return `9`, the fifth decimal.
+
+You may have to find the first 1000 decimals of π somewhere.
+
+# --hints--
+
+`getPiDecimal(5)` should return `9`.
+
+```js
+assert.strictEqual(getPiDecimal(5), 9);
+```
+
+`getPiDecimal(10)` should return `5`.
+
+```js
+assert.strictEqual(getPiDecimal(10), 5);
+```
+
+`getPiDecimal(22)` should return `6`.
+
+```js
+assert.strictEqual(getPiDecimal(22), 6);
+```
+
+`getPiDecimal(39)` should return `7`.
+
+```js
+assert.strictEqual(getPiDecimal(39), 7);
+```
+
+`getPiDecimal(76)` should return `2`.
+
+```js
+assert.strictEqual(getPiDecimal(76), 2);
+```
+
+`getPiDecimal(384)` should return `4`.
+
+```js
+assert.strictEqual(getPiDecimal(384), 4);
+```
+
+`getPiDecimal(601)` should return `0`.
+
+```js
+assert.strictEqual(getPiDecimal(601), 0);
+```
+
+`getPiDecimal(1000)` should return `9`.
+
+```js
+assert.strictEqual(getPiDecimal(1000), 9);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function getPiDecimal(n) {
+
+  return n;
+}
+```
+
+# --solutions--
+
+```js
+function getPiDecimal(n) {
+  const pi = "31415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989"
+
+  return Number(pi[n]);
+}
+```