Add challenges for 2023: day 1

Author: monicatvera

2023/challenge-01/README.md

@@ -0,0 +1,32 @@
+# Challenge #1: 🎁 First Repeated Gift!
+
+## 🔢 Instructions
+
+In Santa's toy factory at the North Pole, each toy has a unique identification number.
+
+However, due to a glitch in the toy-making machine, some numbers have been assigned to more than one toy.
+
+Your task is to find the first identification number that has been repeated, where the second occurrence has the smallest index!
+
+In simpler terms, if there are multiple repeated numbers, return the number whose second occurrence appears first in the list. If no numbers are repeated, return -1.
+
+### Example:
+
+```javascript
+const giftIds = [2, 1, 3, 5, 3, 2];
+const firstRepeatedId = findFirstRepeated(giftIds);
+console.log(firstRepeatedId); // 3
+// Although both 2 and 3 are repeated,
+// 3 appears first for the second time
+
+const giftIds2 = [1, 2, 3, 4];
+const firstRepeatedId2 = findFirstRepeated(giftIds2);
+console.log(firstRepeatedId2); // -1
+// It's -1 as no number is repeated
+
+const giftIds3 = [5, 1, 5, 1];
+const firstRepeatedId3 = findFirstRepeated(giftIds3);
+console.log(firstRepeatedId3); // 5
+```
+
+Be cautious! The elves say that this is a Google technical test.

2023/challenge-01/solution.js

@@ -0,0 +1,5 @@
+function findFirstRepeated(gifts) {
+  const seen = new Set();
+
+  return gifts.find((gift) => seen.has(gift) || !seen.add(gift)) || -1;
+}

2023/challenge-01/solution.spec.js

@@ -0,0 +1,29 @@
+import { findFirstRepeated } from "./solution";
+
+describe("Challenge #1: 🎁 First Repeated Gift!", () => {
+  const testCases = [
+    createTestCase(
+      [2, 1, 3, 5, 3, 2],
+      3,
+      "should return the first repeated gift ID with the smallest second occurrence index"
+    ),
+    createTestCase(
+      [1, 2, 3, 4],
+      -1,
+      "should return -1 when no numbers are repeated"
+    ),
+    createTestCase(
+      [5, 1, 5, 1],
+      5,
+      "should return the first repeated gift ID when there are repeated numbers"
+    ),
+  ];
+
+  it.each(testCases)("#$# $description", ({ input, expected, description }) => {
+    expect(findFirstRepeated(input)).toEqual(expected);
+  });
+});
+
+function createTestCase(input, expected, description) {
+  return { input, expected, description };
+}

2023/challenge-04/README.md

@@ -0,0 +1,52 @@
+# Box inside a box and another...
+
+## 🔢 Instructions
+
+Santa Claus needs to review his gift boxes to make sure he can pack them all in his sleigh. He has a series of **boxes of different sizes, characterized by their length, width, and height**.
+
+Your task is to **write a function** that, given a list of boxes with their sizes, determines whether it is possible to pack **all the boxes in one so that each box contains another** (which in turn contains another, and so on).
+
+Each box represents its measures with an object. For example: `{l: 2, w: 3, h: 2}`. This means that the box has a length of 2, a width of 3 and a height of 2.
+
+A box fits into another box if all the sides of the first are smaller than the sides of the second. **The elves have told us that the boxes cannot be rotated**, so you cannot put a box of 2x3x2 in a box of 3x2x2. Let's see some examples:
+
+```javascript
+fitsInOneBox([
+  { l: 1, w: 1, h: 1 },
+  { l: 2, w: 2, h: 2 }
+]); // true
+```
+
+In the previous example, the smallest box fits into the largest box. Therefore, it is possible to pack all the boxes in one. Now let's see a case that does not:
+
+```javascript
+const boxes = [
+  { l: 1, w: 1, h: 1 },
+  { l: 2, w: 2, h: 2 },
+  { l: 3, w: 1, h: 3 }
+];
+
+fitsInOneBox(boxes); // false
+```
+
+In the previous example, the smallest box fits into the middle box, but the middle box does not fit into the largest box. Therefore, it is not possible to pack all the boxes in one.
+
+Note that the boxes may not come in order:
+
+```javascript
+const boxes = [
+  { l: 1, w: 1, h: 1 },
+  { l: 3, w: 3, h: 3 },
+  { l: 2, w: 2, h: 2 }
+];
+
+fitsInOneBox(boxes); // true
+```
+
+In the previous example, the first box fits into the third, and the third into the second. Therefore, it is possible to pack all the boxes in one.
+
+**Things to keep in mind**:
+
+- The boxes cannot be rotated because the elves have told us that the machine is not ready.
+- The boxes may come in any order.
+- The boxes are not always squares, they could be rectangles.

README.md

@@ -43,13 +43,14 @@ This repository contains the solutions to the challenges proposed by [@midudev](
 | 24  |                   [Comparando árboles de Navidad](2021/24-arboles)                   |       🟠       | [Show](2021/24-arboles/24-arboles.md) |
 | 25  |            [El último juego y hasta el año que viene 👋](2021/25-juego)            |       🟠       | [Show](2021/25-juego/25-juego.md) |
 
+[^1]: **Difficulty**: 🟢 Easy 🟠 Medium 🔴 Hard 🟣 Very Hard
 </details>
 
 </br>
 
 ## 🤖 2022
 
-<details open>
+<details hide>
 
 <summary>Show / Hide</summary>
 
@@ -83,4 +84,21 @@ This repository contains the solutions to the challenges proposed by [@midudev](
 
 [^1]: **Difficulty**: 🟢 Easy 🟠 Medium 🔴 Hard 🟣 Very Hard
 
+</details>
+
+</br>
+
+## 🎁 2023
+
+<details open>
+
+<summary>Show / Hide</summary>
+
+### 🎮️ Challenges
+|  #  |                           Challenge                           | Difficulty[^1] |               Solution                |
+| :-: | :-----------------------------------------------------------: | :------------: | :-----------------------------------: |
+| 01  |   [First repeat gift!](2023/challenge-01)    |       🟢       | [Show](2023/challenge-01/solution.js) |
+
+[^1]: **Difficulty**: 🟢 Easy 🟠 Medium 🔴 Hard 🟣 Very Hard
+
 </details>