Search
⌘K
Get Premium
Leetcode 1689. 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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.