Add solution #1689

JoshCrozier · JoshCrozier · commit 41d2f9867b1c · 2025-04-26T12:45:55.000-05:00
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# 1,476 LeetCode solutions in JavaScript
+# 1,477 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1301,6 +1301,7 @@
 1686|[Stone Game VI](./solutions/1686-stone-game-vi.js)|Medium|
 1687|[Delivering Boxes from Storage to Ports](./solutions/1687-delivering-boxes-from-storage-to-ports.js)|Hard|
 1688|[Count of Matches in Tournament](./solutions/1688-count-of-matches-in-tournament.js)|Easy|
+1689|[Partitioning Into Minimum Number Of Deci-Binary Numbers](./solutions/1689-partitioning-into-minimum-number-of-deci-binary-numbers.js)|Medium|
 1716|[Calculate Money in Leetcode Bank](./solutions/1716-calculate-money-in-leetcode-bank.js)|Easy|
 1718|[Construct the Lexicographically Largest Valid Sequence](./solutions/1718-construct-the-lexicographically-largest-valid-sequence.js)|Medium|
 1726|[Tuple with Same Product](./solutions/1726-tuple-with-same-product.js)|Medium|
diff --git a/solutions/1689-partitioning-into-minimum-number-of-deci-binary-numbers.js b/solutions/1689-partitioning-into-minimum-number-of-deci-binary-numbers.js
@@ -0,0 +1,23 @@
+/**
+ * 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
+ * https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/
+ * Difficulty: Medium
+ *
+ * A decimal number is called deci-binary if each of its digits is either 0 or 1 without any
+ * leading zeros. For example, 101 and 1100 are deci-binary, while 112 and 3001 are not.
+ *
+ * Given a string n that represents a positive decimal integer, return the minimum number of
+ * positive deci-binary numbers needed so that they sum up to n.
+ */
+
+/**
+ * @param {string} n
+ * @return {number}
+ */
+var minPartitions = function(n) {
+  let maxDigit = 0;
+  for (const digit of n) {
+    maxDigit = Math.max(maxDigit, parseInt(digit));
+  }
+  return maxDigit;
+};
