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/greatest-subsequential-sum.md

@@ -3,6 +3,7 @@ id: 5a23c84252665b21eecc7e84
 title: 最重要的后续总和
 challengeType: 5
 videoUrl: ''
+dashedName: greatest-subsequential-sum
 ---
 
 # --description--
@@ -70,5 +71,41 @@ assert.deepEqual(maximumSubsequence([-1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1]), [
 ]);
 ```
 
+# --seed--
+
+## --seed-contents--
+
+```js
+function maximumSubsequence(population) {
+
+}
+```
+
 # --solutions--
 
+```js
+function maximumSubsequence(population) {
+  function sumValues(arr) {
+      var result = 0;
+      for (var i = 0, len = arr.length; i < len; i++) {
+          result += arr[i];
+      }
+      return result;
+  }
+  var greatest;
+  var maxValue = 0;
+
+  for (var i = 0, len = population.length; i < len; i++) {
+      for (var j = i; j <= len; j++) {
+          var subsequence = population.slice(i, j);
+          var value = sumValues(subsequence);
+          if (value > maxValue) {
+              maxValue = value;
+              greatest = subsequence;
+          };
+      }
+  }
+
+  return greatest;
+}
+```