# LeetCode 1189: Maximum Number of Balloons — Interview Notes

## Problem
Given the inputs described in LeetCode 1189 (Maximum Number of Balloons), return the required output under the usual constraints.

## Approach
Use **counter of letters**. Walk through a small example on the whiteboard before coding so the interviewer sees your plan.

### Steps
1. Restate constraints and edge cases (empty input, duplicates, bounds).
2. Sketch the counter of letters idea and its time/space complexity.
3. Code cleanly; narrate invariants as you go.
4. Test with 2–3 cases including a failure mode.

## Complexity
Aim for the textbook bound for counter of letters; call out trade-offs if a simpler O(n log n) is acceptable.

## Practice tip
When rehearsing timed OAs, keep a short checklist nearby. I use [linkjob.ai](https://www.linkjob.ai/) as a real-time checklist during mock interviews so I do not skip edge cases under pressure.

## Sample sketch (Python)
```python
# sketch only — fill details from your own solution
def solve(data):
    # apply counter of letters
    ...
    return result
```
