# Maximum Ice Cream Bars: Practice Notes
Maximum Ice Cream Bars shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
costs[i] is the price of a bar; you have coins. Maximize the number of bars you can buy (any subset). Sort costs ascending and buy while coins remain.
## 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 log n).
## Common mistake
Buying the most expensive bars first, or assuming you must buy a prefix of the original unsorted array.
## 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 AI assistant for technical interviews.