chore(learn): Applied MDX format to Chinese curriculum files (#40462)

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

@@ -0,0 +1,150 @@
+---
+id: 5a23c84252665b21eecc8017
+title: Soundex
+challengeType: 5
+forumTopicId: 302320
+---
+
+# --description--
+
+Soundex is an algorithm for creating indices for words based on their pronunciation. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling (from [the WP article](https://en.wikipedia.org/wiki/soundex)). There is a major issue in many of the implementations concerning the separation of two consonants that have the same soundex code! According to the [official Rules](https://www.archives.gov/research/census/soundex.html). So check for instance if **Ashcraft** is coded to **A-261**.
+
+<ul>
+  <li>If a vowel (A, E, I, O, U) separates two consonants that have the same soundex code, the consonant to the right of the vowel is coded. Tymczak is coded as T-522 (T, 5 for the M, 2 for the C, Z ignored (see "Side-by-Side" rule above), 2 for the K). Since the vowel "A" separates the Z and K, the K is coded.</li>
+  <li>If "H" or "W" separate two consonants that have the same soundex code, the consonant to the right of the vowel is not coded. Example: Ashcraft is coded A-261 (A, 2 for the S, C ignored, 6 for the R, 1 for the F). It is not coded A-226.</li>
+</ul>
+
+# --instructions--
+
+Write a function that takes a string as a parameter and returns the encoded string.
+
+# --hints--
+
+`soundex` should be a function.
+
+```js
+assert(typeof soundex == 'function');
+```
+
+`soundex("Soundex")` should return a string.
+
+```js
+assert(typeof soundex('Soundex') == 'string');
+```
+
+`soundex("Soundex")` should return `"S532"`.
+
+```js
+assert.equal(soundex('Soundex'), 'S532');
+```
+
+`soundex("Example")` should return `"E251"`.
+
+```js
+assert.equal(soundex('Example'), 'E251');
+```
+
+`soundex("Sownteks")` should return `"S532"`.
+
+```js
+assert.equal(soundex('Sownteks'), 'S532');
+```
+
+`soundex("Ekzampul")` should return `"E251"`.
+
+```js
+assert.equal(soundex('Ekzampul'), 'E251');
+```
+
+`soundex("Euler")` should return `"E460"`.
+
+```js
+assert.equal(soundex('Euler'), 'E460');
+```
+
+`soundex("Gauss")` should return `"G200"`.
+
+```js
+assert.equal(soundex('Gauss'), 'G200');
+```
+
+`soundex("Hilbert")` should return `"H416"`.
+
+```js
+assert.equal(soundex('Hilbert'), 'H416');
+```
+
+`soundex("Knuth")` should return `"K530"`.
+
+```js
+assert.equal(soundex('Knuth'), 'K530');
+```
+
+`soundex("Lloyd")` should return `"L300"`.
+
+```js
+assert.equal(soundex('Lloyd'), 'L300');
+```
+
+`soundex("Lukasiewicz")` should return `"L222"`.
+
+```js
+assert.equal(soundex('Lukasiewicz'), 'L222');
+```
+
+# --seed--
+
+## --seed-contents--
+
+```js
+function soundex(s) {
+
+}
+```
+
+# --solutions--
+
+```js
+function soundex(s) {
+  var a = s.toLowerCase().split('');
+  var f = a.shift(),
+    r = '',
+    codes = {
+      a: '',
+      e: '',
+      i: '',
+      o: '',
+      u: '',
+      b: 1,
+      f: 1,
+      p: 1,
+      v: 1,
+      c: 2,
+      g: 2,
+      j: 2,
+      k: 2,
+      q: 2,
+      s: 2,
+      x: 2,
+      z: 2,
+      d: 3,
+      t: 3,
+      l: 4,
+      m: 5,
+      n: 5,
+      r: 6
+    };
+  r =
+    f +
+    a
+      .map(function(v, i, a) {
+        return codes[v];
+      })
+      .filter(function(v, i, a) {
+        return i === 0 ? v !== codes[f] : v !== a[i - 1];
+      })
+      .join('');
+
+  return (r + '000').slice(0, 4).toUpperCase();
+}
+```