• Home
• com.github.javadev
• leetcode-in-java11
• 1.19
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1101_1200.s1189_maximum_number_of_balloons.readme.md Maven / Gradle / Ivy

1189\. Maximum Number of Balloons

Easy

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.