# Maximum Number Of Balloons: Walkthrough

Maximum Number Of Balloons shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Count how many times you can form the word 'balloon' from the letters in text. Count frequencies of b,a,l,o,n; the answer is min(b, a, l//2, o//2, n).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Forgetting that 'l' and 'o' are needed twice, or requiring the letters to appear as a contiguous substring.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at try it free.