Add solution #423

Author: JoshCrozier

0423-reconstruct-original-digits-from-english.js

@@ -0,0 +1,28 @@
+/**
+ * 423. Reconstruct Original Digits from English
+ * https://leetcode.com/problems/reconstruct-original-digits-from-english/
+ * Difficulty: Medium
+ *
+ * Given a string s containing an out-of-order English representation of digits 0-9,
+ * return the digits in ascending order.
+ */
+
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var originalDigits = function(s) {
+  const c = new Array(26).fill(0);
+  const d = new Array(10).fill(0);
+
+  for (const char of s) c[char.charCodeAt(0) - 97]++;
+
+  [d[0], d[2], d[4], d[6], d[8]] = [c[25], c[22], c[20], c[23], c[6]];
+  d[3] = c[7] - d[8];
+  d[5] = c[5] - d[4];
+  d[7] = c[18] - d[6];
+  d[1] = c[14] - d[0] - d[2] - d[4];
+  d[9] = (c[13] - d[1] - d[7]) / 2;
+
+  return d.reduce((str, count, i) => str + String(i).repeat(count), '');
+};

README.md

@@ -337,6 +337,7 @@
 419|[Battleships in a Board](./0419-battleships-in-a-board.js)|Medium|
 420|[Strong Password Checker](./0420-strong-password-checker.js)|Hard|
 421|[Maximum XOR of Two Numbers in an Array](./0421-maximum-xor-of-two-numbers-in-an-array.js)|Medium|
+423|[Reconstruct Original Digits from English](./0423-reconstruct-original-digits-from-english.js)|Medium|
 434|[Number of Segments in a String](./0434-number-of-segments-in-a-string.js)|Easy|
 435|[Non-overlapping Intervals](./0435-non-overlapping-intervals.js)|Medium|
 437|[Path Sum III](./0437-path-sum-iii.js)|Medium|