Watch 10 video solutions for Maximum Number of Balloons, a easy level problem involving Hash Table, String, Counting. This walkthrough by NeetCode has 25,417 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
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 <= 104text consists of lower case English letters only.
Note: This question is the same as 2287: Rearrange Characters to Make Target String.