# Lemonade Change: Study Guide

Lemonade Change shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Bills arrive as 5, 10, or 20. A 5 is kept; a 10 needs one 5; a 20 needs one 10+5 if possible, else three 5s (greedy: spend the 10 first so 5s remain for future 10s). Return whether you can always make change.

## 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

Always breaking a 20 with three 5s, which can leave you unable to change a later 10.

## 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 official website.