1189. Maximum Number of Balloons
https://leetcode.com/problems/maximum-number-of-balloons
Description
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 <= 104
text
consists of lower case English letters only.
ac
Previous1188. Design Bounded Blocking QueueNext1190. Reverse Substrings Between Each Pair of Parentheses
Last updated
Was this helpful?