1189 - Maximum Number of Balloons

[ralph44]

Description of the Problem

Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible.

You can use each character in text at most once. Return the maximum number of instances that can be formed.

Example 1:

Input: text = "nlaebolko"
Output: 1
Example 2:

Input: text = "loonbalxballpoon"
Output: 2
Example 3:

Input: text = "leetcode"
Output: 0

Constraints:

1 <= text.length <= 10^4
text consists of lower case English letters only.

Code

class Solution(object):
    def maxNumberOfBalloons(self, text):
        """
        :type text: str
        :rtype: int
        """
        a_count = text.count("b")
        b_count = text.count("a")
        l_count = text.count("l") / 2
        o_count = text.count("o") / 2
        n_count = text.count("n") 
        return int(min([a_count,b_count,l_count,o_count,n_count]))

Link To The LeetCode Problem

LeetCode

[ralph44]

Please assign this issue to me @vJechsmayr