1189 Maximum Number of Balloons

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:

nlaebolko
nla bol o

Input: text = "nlaebolko"
Output: 1

Example 2:

loonbalxballpoon
loonbal
        ball oon

Input: text = "loonbalxballpoon"
Output: 2

Example 3:

Input: text = "leetcode"
Output: 0

Constraints:

• 1 <= text.length <= 104
• text consists of lower case English letters only.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

class Solution:
    def maxNumberOfBalloons(self, text: str) -> int:
        counter = {'b':0, 'a':0, 'l':0, 'o':0, 'n':0}
        for char in text:
            if char in counter:
                counter[char] += 1

        counter['l'] //= 2
        counter['o'] //= 2
        return min(counter.values())