Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1189. Maximum Number of Balloons
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source