# Cheapest Flights Within K Stops: Explained
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 at most K+1 times, or BFS layers of (city, stops) with a price prune.
## 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/DFS, union-find, topological sort, or tree 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(K E).
## Common mistake
A plain Dijkstra without a stops dimension, which can settle a cheap-but-too-many-stops path first.
## 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 Linkjob.