Partitioning Into Minimum Number Of Deci-Binary Numbers

Given a decimal string n, find the minimum count of positive deci-binary numbers (digits only 0 or 1, no leading zeros) whose sum equals n — the key observation is that each decimal digit requires as many 1s stacked in that position as its value, so the answer equals the maximum digit in n.