Leetcode 1189. Maximum Number of Balloons

Count the frequency of letters in the input string and determine how many times you can assemble the word "balloon" (using each character once), noting that 'l' and 'o' are required twice per instance; the result is the minimum of available count divided by required count for each letter.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1189. Maximum Number of Balloons

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact