From 85b79c66423405622592febbf586c2282b7b1fda Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Mon, 19 Sep 2022 14:00:23 -0400 Subject: [PATCH] Create README - LeetHub --- .../README.md | 33 +++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 1689-partitioning-into-minimum-number-of-deci-binary-numbers/README.md diff --git a/1689-partitioning-into-minimum-number-of-deci-binary-numbers/README.md b/1689-partitioning-into-minimum-number-of-deci-binary-numbers/README.md new file mode 100644 index 0000000..c10950e --- /dev/null +++ b/1689-partitioning-into-minimum-number-of-deci-binary-numbers/README.md @@ -0,0 +1,33 @@ +

1689. Partitioning Into Minimum Number Of Deci-Binary Numbers

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.

+ +

 

+

Example 1:

+ +
Input: n = "32"
+Output: 3
+Explanation: 10 + 11 + 11 = 32
+
+ +

Example 2:

+ +
Input: n = "82734"
+Output: 8
+
+ +

Example 3:

+ +
Input: n = "27346209830709182346"
+Output: 9
+
+ +

 

+

Constraints:

+ + +
\ No newline at end of file