1297. Maximum Number of Balloons

• Difficulty: Easy

• Topics: Hash Table, String

• Similar Questions:

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.

Solutions:

class Solution {
public:
    int maxNumberOfBalloons(string text) {
        int charCount[26] = {0};
        for (auto& c : text) {
            ++charCount[c - 'a'];
        }

        int ret = INT_MAX;
        string target = "baon";

        for (auto& c : target) {
            ret = min(ret, charCount[c - 'a']);
        }

        ret = min(ret, charCount['l' - 'a'] / 2);
        ret = min(ret, charCount['o' - 'a'] / 2);

        return ret == INT_MAX ? 0 : ret;
    }
};