Add solution #1416

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,291 LeetCode solutions in JavaScript
+# 1,292 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1082,6 +1082,7 @@
 1413|[Minimum Value to Get Positive Step by Step Sum](./solutions/1413-minimum-value-to-get-positive-step-by-step-sum.js)|Easy|
 1414|[Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](./solutions/1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k.js)|Medium|
 1415|[The k-th Lexicographical String of All Happy Strings of Length n](./solutions/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js)|Medium|
+1416|[Restore The Array](./solutions/1416-restore-the-array.js)|Hard|
 1422|[Maximum Score After Splitting a String](./solutions/1422-maximum-score-after-splitting-a-string.js)|Easy|
 1431|[Kids With the Greatest Number of Candies](./solutions/1431-kids-with-the-greatest-number-of-candies.js)|Easy|
 1436|[Destination City](./solutions/1436-destination-city.js)|Easy|

solutions/1416-restore-the-array.js

@@ -0,0 +1,37 @@
+/**
+ * 1416. Restore The Array
+ * https://leetcode.com/problems/restore-the-array/
+ * Difficulty: Hard
+ *
+ * A program was supposed to print an array of integers. The program forgot to print whitespaces
+ * and the array is printed as a string of digits s and all we know is that all integers in the
+ * array were in the range [1, k] and there are no leading zeros in the array.
+ *
+ * Given the string s and the integer k, return the number of the possible arrays that can be
+ * printed as s using the mentioned program. Since the answer may be very large, return it modulo
+ * 109 + 7.
+ */
+
+/**
+ * @param {string} s
+ * @param {number} k
+ * @return {number}
+ */
+function numberOfArrays(s, k) {
+  const MOD = 1e9 + 7;
+  const dp = new Array(s.length + 1).fill(0);
+  dp[0] = 1;
+
+  for (let i = 1; i <= s.length; i++) {
+    let num = 0;
+    for (let j = i - 1; j >= Math.max(0, i - String(k).length); j--) {
+      if (j < 0) break;
+      num = Number(s[j]) * Math.pow(10, i - j - 1) + num;
+      if (num <= k && (s[j] !== '0')) {
+        dp[i] = (dp[i] + dp[j]) % MOD;
+      }
+    }
+  }
+
+  return dp[s.length];
+}