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/combinations.md

@@ -3,6 +3,7 @@ id: 5958469238c0d8d2632f46db
 title: 组合
 challengeType: 5
 videoUrl: ''
+dashedName: combinations
 ---
 
 # --description--
@@ -50,5 +51,50 @@ assert.deepEqual(combinations(testInput1[0], testInput1[1]), testOutput1);
 assert.deepEqual(combinations(testInput2[0], testInput2[1]), testOutput2);
 ```
 
+# --seed--
+
+## --after-user-code--
+
+```js
+const testInput1 = [3, 5];
+const testOutput1 = [[0, 1, 2], [0, 1, 3], [0, 1, 4], [0, 2, 3], [0, 2, 4], [0, 3, 4], [1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]];
+
+const testInput2 = [4, 6];
+const testOutput2 = [[0, 1, 2, 3], [0, 1, 2, 4], [0, 1, 2, 5], [0, 1, 3, 4], [0, 1, 3, 5], [0, 1, 4, 5], [0, 2, 3, 4], [0, 2, 3, 5], [0, 2, 4, 5], [0, 3, 4, 5], [1, 2, 3, 4], [1, 2, 3, 5], [1, 2, 4, 5], [1, 3, 4, 5], [2, 3, 4, 5]];
+```
+
+## --seed-contents--
+
+```js
+function combinations(m, n) {
+
+  return true;
+}
+```
+
 # --solutions--
 
+```js
+function combinations(m, n) {
+  const nArr = [...Array(n).keys()];
+
+  return (function generateCombinations (size, numArr) {
+    const ret = [];
+
+    for (let i = 0; i < numArr.length; i++) {
+      if (size === 1) {
+        ret.push([numArr[i]]);
+      }
+      else {
+        const sub = generateCombinations(size - 1, numArr.slice(i + 1, numArr.length));
+        for (let subI = 0; subI < sub.length; subI++) {
+          const next = sub[subI];
+          next.unshift(numArr[i]);
+          ret.push(next);
+        }
+      }
+    }
+    return ret;
+  }(m, nArr));
+}
+```