chore(i18n,learn): processed translations (#179)

Author: camperbot

curriculum/challenges/chinese-traditional/00-certifications/a1-professional-chinese/a1-professional-chinese-certification.yml

@@ -0,0 +1,9 @@
+---
+id: 688f1daf0133dbe2a36b140b
+title: A1 Professional Chinese Certification
+certification: a1-professional-chinese-certification
+challengeType: 7
+isPrivate: true
+tests:
+  - id: 688f1daf0133dbe2a36b140b
+    title: "Dialogue 1: PLACEHOLDER"

curriculum/challenges/chinese-traditional/16-the-odin-project/top-build-a-recipe-project/top-build-a-recipe-project.md

@@ -1,7 +1,7 @@
 ---
 id: 6391d1a4f7ac71efd0621380
 title: 創建一個食譜頁面項目
-challengeType: 14
+challengeType: 25
 dashedName: top-build-a-recipe-project
 ---
 

curriculum/challenges/chinese-traditional/16-the-odin-project/top-build-a-rock-paper-scissors-game/build-a-rock-paper-scissors-game.md

@@ -1,7 +1,7 @@
 ---
 id: 66629f407d679d3105e8317f
 title: Build a Rock Paper Scissors Game
-challengeType: 14
+challengeType: 25
 dashedName: top-build-a-rock-paper-scissors-game
 ---
 

curriculum/challenges/chinese-traditional/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-a.md

@@ -1,7 +1,7 @@
 ---
 id: 63ee3f71381756f9716727ef
 title: CSS Foundations Exercise A
-challengeType: 14
+challengeType: 25
 dashedName: css-foundations-exercise-a
 ---
 

curriculum/challenges/chinese-traditional/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-b.md

@@ -1,7 +1,7 @@
 ---
 id: 63ee3fe4381756f9716727f0
 title: CSS Foundations Exercise B
-challengeType: 14
+challengeType: 25
 dashedName: css-foundations-exercise-b
 ---
 

curriculum/challenges/chinese-traditional/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-c.md

@@ -1,7 +1,7 @@
 ---
 id: 63ee3fe9381756f9716727f1
 title: CSS Foundations Exercise C
-challengeType: 14
+challengeType: 25
 dashedName: css-foundations-exercise-c
 ---
 

curriculum/challenges/chinese-traditional/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-d.md

@@ -1,7 +1,7 @@
 ---
 id: 63ee3ff1381756f9716727f2
 title: CSS Foundations Exercise D
-challengeType: 14
+challengeType: 25
 dashedName: css-foundations-exercise-d
 ---
 

curriculum/challenges/chinese-traditional/16-the-odin-project/top-learn-css-foundations-projects/css-foundations-exercise-e.md

@@ -1,7 +1,7 @@
 ---
 id: 63ee3ff8381756f9716727f3
 title: CSS Foundations Exercise E
-challengeType: 14
+challengeType: 25
 dashedName: css-foundations-exercise-e
 ---
 

curriculum/challenges/chinese-traditional/25-front-end-development/lab-adjacency-list-to-matrix-converter/686fdcfe055bcda9f651dd2e.md

@@ -0,0 +1,215 @@
+---
+id: 686fdcfe055bcda9f651dd2e
+title: Build an Adjacency List to Matrix Converter
+challengeType: 27
+dashedName: build-an-adjacency-list-to-matrix-converter
+---
+
+# --description--
+
+In this lab, you will build a function that converts an adjacency list representation of a graph into an adjacency matrix. An adjacency list is a dictionary where each key represents a node, and the corresponding value is a list of nodes that the key node is connected to. An adjacency matrix is a 2D array where the entry at position `[i][j]` is `1` if there's an edge from node `i` to node `j`, and `0` otherwise.
+
+For example, given the adjacency list:
+
+```py
+{
+    0: [1, 2],
+    1: [2],
+    2: [0, 3],
+    3: [2]
+}
+```
+
+The corresponding adjacency matrix would be:
+
+```py
+[
+    [0, 1, 1, 0],
+    [0, 0, 1, 0],
+    [1, 0, 0, 1],
+    [0, 0, 1, 0]
+]
+```
+
+**Objective:** Fulfill the user stories below and get all the tests to pass to complete the lab.
+
+**User Stories:**
+
+1. You should define a function named `adjacency_list_to_matrix` to convert an adjacency list to an adjacency matrix.
+2. The function should take a dictionary representing the adjacency list of an unweighted (either undirected or directed) graph as its argument.
+3. The function should:
+   - Convert the adjacency list to an adjacency matrix.
+   - Print each row in the adjacency matrix.
+   - Return the adjacency matrix.
+
+For example, `adjacency_list_to_matrix({0: [2], 1: [2, 3], 2: [0, 1, 3], 3: [1, 2]})` should print:
+
+```md
+[0, 0, 1, 0]
+[0, 0, 1, 1]
+[1, 1, 0, 1]
+[0, 1, 1, 0]
+```
+
+and return `[[0, 0, 1, 0], [0, 0, 1, 1], [1, 1, 0, 1], [0, 1, 1, 0]]`.
+
+
+# --hints--
+
+You should define a function named `adjacency_list_to_matrix`.
+
+```js
+({ 
+    test: () => assert(runPython(`
+    _Node(_code).has_function("adjacency_list_to_matrix")
+    `)) 
+})
+```
+
+The `adjacency_list_to_matrix` function should have one parameter.
+
+```js
+({ test: () => assert(runPython(`
+    import inspect 
+    sig = inspect.signature(adjacency_list_to_matrix)
+    len(sig.parameters) == 1
+  `))
+})
+```
+
+The function should correctly determine the number of nodes from the adjacency list.
+
+```js
+({ 
+    test: () => runPython(`
+        adj_list = {0: [1], 1: [0], 2: []}
+        result = adjacency_list_to_matrix(adj_list)
+        assert len(result) == 3
+        assert len(result[0]) == 3
+    `) 
+})
+```
+
+The function should correctly set matrix values to `1` for existing edges.
+
+```js
+({ 
+    test: () => runPython(`
+        adj_list = {0: [1], 1: [0]}
+        result = adjacency_list_to_matrix(adj_list)
+        assert result[0][1] == 1
+        assert result[1][0] == 1
+        assert result[0][0] == 0
+        assert result[1][1] == 0
+    `) 
+})
+```
+
+The function should print each row of the matrix.
+
+```js
+({ 
+    test: () => runPython(`
+        import io
+        import sys
+
+        captured_output = io.StringIO()
+        sys.stdout = captured_output
+
+        adj_list = {0: [1], 1: []}
+        adjacency_list_to_matrix(adj_list)
+
+        sys.stdout = sys.__stdout__
+        output = captured_output.getvalue()
+
+        assert "[0, 1]" in output
+        assert "[0, 0]" in output
+    `) 
+})
+```
+
+The function should return the adjacency matrix.
+
+```js
+({ 
+    test: () => runPython(`
+        adj_list = {0: [1], 1: []}
+        result = adjacency_list_to_matrix(adj_list)
+        assert result == [[0, 1], [0, 0]]
+    `) 
+})
+```
+
+When given the adjacency list `{0: [1, 2], 1: [2], 2: [0, 3], 3: [2]}`, the function should return `[[0, 1, 1, 0], [0, 0, 1, 0], [1, 0, 0, 1], [0, 0, 1, 0]]`.
+
+```js
+({ 
+    test: () => runPython(`
+        adj_list = {0: [1, 2], 1: [2], 2: [0, 3], 3: [2]}
+        result = adjacency_list_to_matrix(adj_list)
+        expected = [[0, 1, 1, 0], [0, 0, 1, 0], [1, 0, 0, 1], [0, 0, 1, 0]]
+        assert result == expected
+    `) 
+})
+```
+
+When given the adjacency list `{0: [1], 1: [0]}`, the function should return `[[0, 1], [1, 0]]`.
+
+```js
+({ 
+    test: () => runPython(`
+        adj_list = {0: [1], 1: [0]}
+        result = adjacency_list_to_matrix(adj_list)
+        expected = [[0, 1], [1, 0]]
+        assert result == expected
+    `) 
+})
+```
+
+When given the adjacency list `{0: [], 1: [], 2: []}`, the function should return `[[0, 0, 0], [0, 0, 0], [0, 0, 0]]`.
+
+```js
+({ 
+    test: () => runPython(`
+        adj_list = {0: [], 1: [], 2: []}
+        result = adjacency_list_to_matrix(adj_list)
+        expected = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]
+        assert result == expected
+    `) 
+})
+```
+
+# --seed--
+
+## --seed-contents--
+
+```py
+
+```
+
+# --solutions--
+
+```py
+def adjacency_list_to_matrix(adj_list):
+    n = len(adj_list)
+
+    adj_matrix = [[0] * n for _ in range(n)]
+
+    for src_node, neighbors in adj_list.items(): 
+        for dest_node in neighbors:
+            adj_matrix[src_node][dest_node] = 1
+
+    for row in adj_matrix:
+        print(row)
+
+    return adj_matrix
+
+adj_list = {
+    0: [1, 2],
+    1: [2],
+    2: [0, 3],
+    3: [2]
+}
+
+matrix = adjacency_list_to_matrix(adj_list)
+```

curriculum/challenges/chinese-traditional/25-front-end-development/lab-availability-table/66b36358ed4f261d64840c24.md

@@ -8,7 +8,7 @@ demoType: onClick
 
 # --description--
 
-Fulfill the user stories below and get all the tests to pass to complete the lab.
+**Objective:** Fulfill the user stories below and get all the tests to pass to complete the lab.
 
 **用戶需求:**