LeetCode in Kotlin

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:

• 1 <= text.length <= 104
• text consists of lower case English letters only.

Solution

class Solution {
    fun maxNumberOfBalloons(text: String): Int {
        val counts = IntArray(26)
        for (c in text.toCharArray()) {
            counts[c.code - 'a'.code]++
        }
        return Math.min(
            counts[0],
            Math.min(
                counts[1], Math.min(counts[11] / 2, Math.min(counts[14] / 2, counts[13]))
            )
        )
    }
}

This site is open source. Improve this page.