# Can You Eat Your Favorite Candy On Your Favorite Day: Study Guide
Can You Eat Your Favorite Candy On Your Favorite Day shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Prefix-sum candy counts. For each query (type, day, cap) you can eat favorite candy on that day iff you could have reached that type by eating at most cap per day and you have not been forced to finish it before the day (there are enough candies after previous types to cover day+1 at speed 1, and previous types do not exceed cap*(day+1)).
## 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 + q).
## Common mistake
Ignoring the daily cap or the you-must-eat-at-least-one-a-day lower bound.
## 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 best AI tool for coding tests and OAs.