> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/1189-maximum-number-of-balloons.md).

# 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:**

![](https://assets.leetcode.com/uploads/2019/09/05/1536_ex1_upd.JPG)

```
**Input:** text = "nlaebolko"
**Output:** 1
```

**Example 2:**

![](https://assets.leetcode.com/uploads/2019/09/05/1536_ex2_upd.JPG)

```
**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

```java
```