feat(curriculum): restore seed + solution to Chinese (#40683)

* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>

curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/department-numbers.md

@@ -3,6 +3,7 @@ id: 59f40b17e79dbf1ab720ed7a
 title: 部门编号
 challengeType: 5
 videoUrl: ''
+dashedName: department-numbers
 ---
 
 # --description--
@@ -35,5 +36,67 @@ assert(combinations(nums, total).length === len);
 assert.deepEqual(combinations(nums, total), result);
 ```
 
+# --seed--
+
+## --after-user-code--
+
+```js
+const nums = [1, 2, 3, 4, 5, 6, 7];
+const total = 12;
+const len = 14;
+const result = [
+  [2, 3, 7],
+  [2, 4, 6],
+  [2, 6, 4],
+  [2, 7, 3],
+  [4, 1, 7],
+  [4, 2, 6],
+  [4, 3, 5],
+  [4, 5, 3],
+  [4, 6, 2],
+  [4, 7, 1],
+  [6, 1, 5],
+  [6, 2, 4],
+  [6, 4, 2],
+  [6, 5, 1]
+];
+```
+
+## --seed-contents--
+
+```js
+function combinations(possibleNumbers, total) {
+
+  return true;
+}
+```
+
 # --solutions--
 
+```js
+function combinations(possibleNumbers, total) {
+  let firstNumber;
+  let secondNumber;
+  let thridNumber;
+  const allCombinations = [];
+
+  for (let i = 0; i < possibleNumbers.length; i += 1) {
+    firstNumber = possibleNumbers[i];
+
+    if (firstNumber % 2 === 0) {
+      for (let j = 0; j < possibleNumbers.length; j += 1) {
+        secondNumber = possibleNumbers[j];
+
+        if (j !== i && firstNumber + secondNumber <= total) {
+          thridNumber = total - firstNumber - secondNumber;
+
+          if (thridNumber !== firstNumber && thridNumber !== secondNumber && possibleNumbers.includes(thridNumber)) {
+            allCombinations.push([firstNumber, secondNumber, thridNumber]);
+          }
+        }
+      }
+    }
+  }
+  return allCombinations;
+}
+```