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.
You receive a string n that represents a positive decimal integer, provide the minimum count 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
1 <= n.length <= 10^5nconsists of only digits.ndoes not contain any leading zeros and represents a positive integer.
Did this problem appear in one of your interviews?
Responses stay private.