# Cheapest Flights Within K Stops: Interview Notes
Cheapest Flights Within K Stops shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Bellman-Ford relaxed exactly K+1 times (K stops means K+1 edges): for each round, relax every flight from a snapshot of the previous distances so you do not use more than that many edges.
## 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(K E).
## Common mistake
A plain Dijkstra that ignores the stop limit, or relaxing in place inside a round and accidentally using more than K+1 edges.
## 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 undetectable AI interview copilot.