# Minimum Cost For Tickets: Study Guide
Minimum Cost For Tickets shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DP over days: on a travel day buy a 1-, 7-, or 30-day pass and jump to the first day not covered; skip non-travel days for free.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(D).
## Common mistake
Buying a pass on every remaining day instead of jumping past the covered window.
## 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 coding interview assistant.