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.