Tap here to switch tabs
Problem
Submissions

Problem: Maximum Number of Balloons

Maximum Number of Balloons asks you to use the letters in a given string to form as many complete instances of "balloon" as possible, using each character at most once.

Statement

Given a string text, return the maximum number of instances of the word "balloon" that can be formed.

Each character from text can be used at most 11 time.

Constraints:

  • 1≤1 \leq text.length ≤104\leq 10^4

  • text consists of lowercase English letters only.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Maximum Number of Balloons

Maximum Number of Balloons asks you to use the letters in a given string to form as many complete instances of "balloon" as possible, using each character at most once.

Statement

Given a string text, return the maximum number of instances of the word "balloon" that can be formed.

Each character from text can be used at most 11 time.

Constraints:

  • 1≤1 \leq text.length ≤104\leq 10^4

  • text consists of lowercase English letters only.