✨ Challenge #8: Sorting the warehouse

Author: monicatvera

2023/challenge-08/README.md

@@ -0,0 +1,27 @@
+## Challenge #8: 🏬 Sorting the warehouse
+
+The elves are very busy in Santa Claus' workshop organizing gifts 🎁 for Christmas Eve 🎄.
+
+The input format is special, as it indicates the number of gifts and the type of gift with letters from a to z. For example, '66a11b' means 66 a gifts and 11 b gifts.
+
+The elves have a special system for organizing the gifts:
+
+- Every 10 gifts of the same type are packed in a box, represented by {x}. For example, 20 type a gifts are packed in two boxes like this: {a}{a}.
+- Every 5 boxes are stacked on a pallet, represented by [x]. For example, 10 a boxes are stacked on 2 pallets in this way: [a][a].
+- Any additional gift is placed in a bag, represented by () and all of them are placed inside. For example, 4 b gifts are placed in a bag like this (bbbb).
+  
+The gifts are then placed in the following order: pallets, boxes, and bags. And the gifts appear in the same order as the input string.
+
+Your task is to write a function `organizeGifts` that takes a string of gifts as an argument and returns a string representing the warehouse.
+
+```javascript
+const result1 = organizeGifts('76a11b')
+console.log(result1)
+// `[a]{a}{a}(aaaaaa){b}(b)`
+
+/* Explanation:
+
+  76a: 76 gifts type 'a' would be packed in 7 boxes and 6 gifts would be left, resulting in 1 pallet [a] (for the first 5 boxes), 2 loose boxes {a}{a} and a bag with 6 gifts (aaaaaa)
+
+  11b: 11 gifts type 'b' would be packed in 1 box and 1 gift would be left, resulting in 1 loose box {b} and a bag with 1 gift (b)
+```

2023/challenge-08/solution.js

@@ -0,0 +1,27 @@
+function organizeGifts(gifts) {
+  let result = "";
+  let qty = "";
+
+  for (let i = 0; i < gifts.length; i++) {
+    if (isNaN(gifts[i])) {
+      let number = parseInt(qty);
+      while (number >= 50) {
+        const pallets = Math.floor(number / 50);
+        result += `[${gifts[i]}]`.repeat(pallets);
+        number -= 50 * pallets;
+      }
+      while (number >= 10) {
+        const boxes = Math.floor(number / 10);
+        result += `{${gifts[i]}}`.repeat(boxes);
+        number -= 10 * boxes;
+      }
+      if (number >= 1) {
+        result += `(${gifts[i].repeat(number)})`;
+      }
+      qty = "";
+    } else {
+      qty += gifts[i];
+    }
+  }
+  return result;
+}

2023/challenge-08/solution.spec.js

@@ -0,0 +1,29 @@
+import { organizeGifts } from "./solution";
+
+describe("Challenge #8: 🏬 Sorting the warehouse", () => {
+  const testCases = [
+    createTestCase(
+      ["76a11b"],
+      "[a][a][a][a][a][a][a]{a}{a}(aaaaaa){b}(b)",
+      "should organize gifts as specified in the prompt"
+    ),
+    createTestCase(
+      ["30a15b10c"],
+      "[a][a][a][a][a]{a}{a}{a}{a}{a}(aaaaa)[b][b][b][b][b]{b}{b}{b}{b}{b}(bbbbb)[c][c][c][c][c](ccccc)",
+      "should organize gifts as specified in the prompt"
+    ),
+    createTestCase(
+      ["5a5b5c5d5e5f5g5h5i5j5k5l5m5n5o5p5q5r5s5t5u5v5w5x5y5z"],
+      "[a][a][a][a][a]{a}[b][b][b][b][b]{b}[c][c][c][c][c]{c}[d][d][d][d][d]{d}[e][e][e][e][e]{e}[f][f][f][f][f]{f}[g][g][g][g][g]{g}[h][h][h][h][h]{h}[i][i][i][i][i]{i}[j][j][j][j][j]{j}[k][k][k][k][k]{k}[l][l][l][l][l]{l}[m][m][m][m][m]{m}[n][n][n][n][n]{n}[o][o][o][o][o]{o}[p][p][p][p][p]{p}[q][q][q][q][q]{q}[r][r][r][r][r]{r}[s][s][s][s][s]{s}[t][t][t][t][t]{t}[u][u][u][u][u]{u}[v][v][v][v][v]{v}[w][w][w][w][w]{w}[x][x][x][x][x]{x}[y][y][y][y][y]{y}[z][z][z][z][z](zzzzz)",
+      "should organize gifts as specified in the prompt"
+    ),
+  ];
+
+  it.each(testCases)("#$# $description", ({ input, expected, description }) => {
+    expect(organizeGifts(...input)).toEqual(expected);
+  });
+});
+
+function createTestCase(input, expected, description) {
+  return { input, expected, description };
+}

README.md

@@ -104,6 +104,7 @@ This repository contains the solutions to the challenges proposed by [@midudev](
 | 05  |         [Santa's CyberTruck](2023/challenge-05)         |       🟠       | [Show](2023/challenge-05/solution.js) |
 | 06  |        [The reindeer on trial](2023/challenge-06)         |       🟢       | [Show](2023/challenge-06/solution.js) |
 | 07  |        [The 3D boxes](2023/challenge-07)         |       🟢       | [Show](2023/challenge-07/solution.js) |
+| 08  |        [Sorting the warehouse](2023/challenge-08)         |       🟠       | [Show](2023/challenge-08/solution.js) |
 
 [^1]: **Difficulty**: 🟢 Easy 🟠 Medium 🔴 Hard 🟣 Very Hard