Leetcode - Partitioning Into Minimum Number Of Deci-Binary Numbers Solution — The Poor Coder

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:

Text

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

Example 2:

Text

Input: n = "82734"
Output: 8

Example 3:

Text

Input: n = "27346209830709182346"
Output: 9

Constraints:

1 <= n.length <= 10⁵
n consists of only digits.
n does not contain any leading zeros and represents a positive integer.

Solution in Python#

Python

class Solution:
    def minPartitions(self, n: str) -> int:
        return max(n)

May 112021

Leetcode - Car Pooling Solution

You are driving a vehicle that has capacity empty seats initially available for passengers. The vehicle only drives east (ie. it cannot turn around and drive west.) Given a list of trips, trip[i] = [num_passengers…

leetcode greedy1 min read

May 112021

Leetcode - Check If a String Can Break Another String Solution

Given two strings: s1 and s2 with the same size, check if some permutation of string s1 can break some permutation of string s2 or vice-versa. In other words s2 can break s1 or vice-versa. A string x can break string y…

leetcode string greedy1 min read

May 032021

Leetcode - Group the People Given the Group Size They Belong To Solution

There are n people that are split into some unknown number of groups. Each person is labeled with a unique ID from 0 to n - 1. You are given an integer array groupSizes, where groupSizes[i] is the size of the group that…

leetcode greedy2 min read

Solution in Python#

Related posts

Leetcode - Car Pooling Solution

Leetcode - Check If a String Can Break Another String Solution

Leetcode - Group the People Given the Group Size They Belong To Solution