feat(curriculum): daily challenges 144-160 (freeCodeCamp#64530)

Author: moT01

curriculum/challenges/english/blocks/daily-coding-challenges-javascript/69306364df283fcaff2e1ad5.md

@@ -0,0 +1,84 @@
+---
+id: 69306364df283fcaff2e1ad5
+title: "Challenge 144: Resolution Streak"
+challengeType: 28
+dashedName: challenge-144
+---
+
+# --description--
+
+Given an array of arrays, where each sub-array represents a day of your resolution activities and contains three integers: the number of steps walked that day, the minutes of screen time that day, and the number of pages read that day; determine if you are keeping your resolutions.
+
+- The first sub-array is day 1, and second day 2, and so on.
+
+A day is considered successful if all three of the following goals are met:
+
+- You walked at least 10,000 steps.
+- You had no more than 120 minutes of screen time.
+- You read at least five pages.
+
+If all of the given days are successful, return `"Resolution on track: N day streak."` Where `N` is the number of successful days.
+
+If one or more days is not a success, return `"Resolution failed on day X: N day streak."`. Where `X` is the day number of the first unsuccessful day, and `N` is the number of successful days before the first unsuccessful day.
+
+# --hints--
+
+`resolutionStreak([[10500, 75, 15], [11000, 90, 10], [10650, 100, 9]])` should return `"Resolution on track: 3 day streak."`
+
+```js
+assert.equal(resolutionStreak([[10500, 75, 15], [11000, 90, 10], [10650, 100, 9]]), "Resolution on track: 3 day streak.");
+```
+
+`resolutionStreak([[10000, 120, 5], [10950, 121, 11]])` should return `"Resolution failed on day 2: 1 day streak."`
+
+```js
+assert.equal(resolutionStreak([[10000, 120, 5], [10950, 121, 11]]), "Resolution failed on day 2: 1 day streak.");
+```
+
+`resolutionStreak([[15000, 110, 8], [12300, 60, 13], [10100, 120, 4], [9000, 125, 4]])` should return `"Resolution failed on day 3: 2 day streak."`
+
+```js
+assert.equal(resolutionStreak([[15000, 110, 8], [12300, 60, 13], [10100, 120, 4], [9000, 125, 4]]), "Resolution failed on day 3: 2 day streak.");
+```
+
+`resolutionStreak([[11600, 76, 13], [12556, 64, 26], [10404, 32, 59], [9999, 44, 124], [7508, 23, 167], [10900, 80, 0]])` should return `"Resolution failed on day 4: 3 day streak."`
+
+```js
+assert.equal(resolutionStreak([[11600, 76, 13], [12556, 64, 26], [10404, 32, 59], [9999, 44, 124], [7508, 23, 167], [10900, 80, 0]]), "Resolution failed on day 4: 3 day streak.");
+```
+
+`resolutionStreak([[10500, 75, 15], [11000, 90, 10], [10650, 100, 9], [10200, 60, 10], [10678, 87, 9], [12431, 67, 13], [10444, 107, 19], [10111, 95, 5], [10000, 120, 7], [11980, 101, 8]])` should return `"Resolution on track: 10 day streak."`
+
+```js
+assert.equal(resolutionStreak([[10500, 75, 15], [11000, 90, 10], [10650, 100, 9], [10200, 60, 10], [10678, 87, 9], [12431, 67, 13], [10444, 107, 19], [10111, 95, 5], [10000, 120, 7], [11980, 101, 8]]), "Resolution on track: 10 day streak.");
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function resolutionStreak(days) {
+
+  return days;
+}
+```
+
+# --solutions--
+
+```js
+function resolutionStreak(days) {
+  let streak = 0;
+
+  for (let i = 0; i < days.length; i++) {
+    const [steps, screen, pages] = days[i];
+    if (steps >= 10000 && screen <= 120 && pages >= 5) {
+      streak++;
+    } else {
+      return `Resolution failed on day ${i + 1}: ${streak} day streak.`;
+    }
+  }
+
+  return `Resolution on track: ${streak} day streak.`;
+}
+```

curriculum/challenges/english/blocks/daily-coding-challenges-javascript/69306364df283fcaff2e1ad6.md

@@ -0,0 +1,75 @@
+---
+id: 69306364df283fcaff2e1ad6
+title: "Challenge 145: Nth Fibonacci Number"
+challengeType: 28
+dashedName: challenge-145
+---
+
+# --description--
+
+Given an integer `n`, return the `n`th number in the fibonacci sequence.
+
+The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding ones. The first 10 numbers in the sequence are `0`, `1`, `1`, `2`, `3`, `5`, `8`, `13`, `21`, `34`.
+
+# --hints--
+
+`nthFibonacci(4)` should return `2`.
+
+```js
+assert.equal(nthFibonacci(4), 2);
+```
+
+`nthFibonacci(10)` should return `34`.
+
+```js
+assert.equal(nthFibonacci(10), 34);
+```
+
+`nthFibonacci(15)` should return `377`.
+
+```js
+assert.equal(nthFibonacci(15), 377);
+```
+
+`nthFibonacci(40)` should return `63245986`.
+
+```js
+assert.equal(nthFibonacci(40), 63245986);
+```
+
+`nthFibonacci(75)` should return `1304969544928657`.
+
+```js
+assert.equal(nthFibonacci(75), 1304969544928657);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function nthFibonacci(n) {
+
+  return n;
+}
+```
+
+# --solutions--
+
+```js
+function nthFibonacci(n) {
+  if (n === 1) return 0;
+  if (n === 2) return 1;
+
+  let a = 0;
+  let b = 1;
+
+  for (let i = 3; i <= n; i++) {
+    const next = a + b;
+    a = b;
+    b = next;
+  }
+
+  return b;
+}
+```

curriculum/challenges/english/blocks/daily-coding-challenges-javascript/69306364df283fcaff2e1ad7.md

@@ -0,0 +1,107 @@
+---
+id: 69306364df283fcaff2e1ad7
+title: "Challenge 146: Left-Handed Seat at the Table"
+challengeType: 28
+dashedName: challenge-146
+---
+
+# --description--
+
+Given a 4x2 matrix (array of arrays) representing the seating arrangement for a meal, determine how many seats a left-handed person can sit at.
+
+- A left-handed person cannot sit where a right-handed person would be in the seat to the immediate left of them.
+
+In the given matrix:
+
+- An `"R"` is a seat occupied by a right-handed person.
+- An `"L"` is a seat occupied by a left-handed person.
+- An `"U"` is an unoccupied seat.
+- Only unoccupied seats are available to sit at.
+- The seats in the top row are facing "down", and the seats in the bottom row are facing "up" (like a table), so left and right are relative to the seat's orientation.
+- Corner seats only have one seat next to them.
+
+For example, in the given matrix:
+
+```json
+[
+  ["U", "R", "U", "L"],
+  ["U", "R", "R", "R"]
+]
+```
+
+The top-left seat is cannot be sat in because there's a right-handed person to the left. The other two open seats can be sat in because there isn't a right-handed person to the left.
+
+# --hints--
+
+`findLeftHandedSeats([["U", "R", "U", "L"], ["U", "R", "R", "R"]])` should return `2`.
+
+```js
+assert.equal(findLeftHandedSeats([["U", "R", "U", "L"], ["U", "R", "R", "R"]]), 2);
+```
+
+`findLeftHandedSeats([["U", "U", "U", "U"], ["U", "U", "U", "U"]])` should return `8`.
+
+```js
+assert.equal(findLeftHandedSeats([["U", "U", "U", "U"], ["U", "U", "U", "U"]]), 8);
+```
+
+`findLeftHandedSeats([["U", "R", "U", "R"], ["L", "R", "R", "U"]])` should return `0`.
+
+```js
+assert.equal(findLeftHandedSeats([["U", "R", "U", "R"], ["L", "R", "R", "U"]]), 0);
+```
+
+`findLeftHandedSeats([["L", "U", "R", "R"], ["L", "U", "R", "R"]])` should return `1`.
+
+```js
+assert.equal(findLeftHandedSeats([["L", "U", "R", "R"], ["L", "U", "R", "R"]]), 1);
+```
+
+`findLeftHandedSeats([["U", "R", "U", "U"], ["U", "U", "L", "U"]])` should return `5`.
+
+```js
+assert.equal(findLeftHandedSeats([["U", "R", "U", "U"], ["U", "U", "L", "U"]]), 5);
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function findLeftHandedSeats(table) {
+
+  return table;
+}
+```
+
+# --solutions--
+
+```js
+function findLeftHandedSeats(table) {
+  let availableSeats = 0;
+
+  const [topRow, bottomRow] = table;
+
+  for (let i=0; i<topRow.length; i++) {
+    if (topRow[i] === 'U') {
+      if (i === 3) {
+        availableSeats++;
+      } else if (topRow[i+1] !== 'R') {
+        availableSeats++;
+      }
+    }
+  }
+
+  for (let i=0; i<bottomRow.length; i++) {
+    if (bottomRow[i] === 'U') {
+      if (i === 0) {
+        availableSeats++;
+      } else if (bottomRow[i-1] !== 'R') {
+        availableSeats++;
+      }
+    }
+  }
+
+  return availableSeats;
+}
+```

curriculum/challenges/english/blocks/daily-coding-challenges-javascript/69306364df283fcaff2e1ad8.md

@@ -0,0 +1,79 @@
+---
+id: 69306364df283fcaff2e1ad8
+title: "Challenge 147: Leap Year Calculator"
+challengeType: 28
+dashedName: challenge-147
+---
+
+# --description--
+
+Given an integer year, determine whether it is a leap year.
+
+A year is a leap year if it satisfies the following rules:
+
+- The year is evenly divisible by 4, and
+- The year is not evenly divisible by 100, unless
+- The year is evenly divisible by 400.
+
+# --hints--
+
+`isLeapYear(2024)` should return `true`.
+
+```js
+assert.isTrue(isLeapYear(2024));
+```
+
+`isLeapYear(2023)` should return `false`.
+
+```js
+assert.isFalse(isLeapYear(2023));
+```
+
+`isLeapYear(2100)` should return `false`.
+
+```js
+assert.isFalse(isLeapYear(2100));
+```
+
+`isLeapYear(2000)` should return `true`.
+
+```js
+assert.isTrue(isLeapYear(2000));
+```
+
+`isLeapYear(1999)` should return `false`.
+
+```js
+assert.isFalse(isLeapYear(1999));
+```
+
+`isLeapYear(2040)` should return `true`.
+
+```js
+assert.isTrue(isLeapYear(2040));
+```
+
+`isLeapYear(2026)` should return `false`.
+
+```js
+assert.isFalse(isLeapYear(2026));
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function isLeapYear(year) {
+
+  return year;
+}
+```
+
+# --solutions--
+
+```js
+function isLeapYear(year) {
+    return ((year % 4 === 0 && year % 100 !== 0) || (year % 400 === 0))
+}
+```