1189. Maximum Number of Balloons
Easy
10 Points
Hash Table
String
Counting
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.
Examples
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 <= 104text consists of lower case English letters only.
1189. Maximum Number of Balloons
Easy
10 Points
Hash Table
String
Counting
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.
Examples
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 <= 104text consists of lower case English letters only.