Maximum Number Of Balloons, is a LeetCode problem. In this post we will see how we can solve this challenge in C++

Problem Description

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

1 <= text.length <= 10^4

....

You can find the full details of the problem Maximum Number of Balloons at LeetCode

Solution: Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @kamyu104