Package g1101_1200.s1189_maximum_number_of_balloons

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    Input: text = "nlaebolko"

    Output: 1

    Example 2:

    Input: text = "loonbalxballpoon"

    Output: 2

    Example 3:

    Input: text = "leetcode"

    Output: 0

    Constraints:

    • <code>1 <= text.length <= 10<sup>4</sup></code>

    • text consists of lower case English letters only.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxNumberOfBalloons(String text)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait