This topic is a practice problem inside the Graphs module. The goal is not to memorize the title: reconstruct the problem it solves, the mechanism that makes it work, and the signal that tells you when to use it.
Remember the shape, not the sentence
“Islands = flood fill. Ordering = topological sort. Shortest path = BFS / Dijkstra.”
What problem does this solve?
Start from the engineering problem rather than the definition. Cheapest Flights Within K Stops (Bellman-Ford) exists because a system needs a reliable way to handle a recurring constraint inside Graphs. Ask what would become slow, ambiguous, unsafe, or impossible without it.
How the mechanism works
Break the idea into observable steps. The useful mental model is: input → transformation → decision or state change → output. Keep each step small enough that you can redraw it from memory. The surrounding module is the context: Islands = flood fill. Ordering = topological sort. Shortest path = BFS / Dijkstra.
When to reach for it
Use nearby concepts as contrasts. In this module, compare Cheapest Flights Within K Stops (Bellman-Ford) with Graph representations + BFS/DFS templates, Interactive: BFS ripple on a grid, Number of Islands. The distinction matters because good engineering choices depend on the constraints, not on memorizing isolated definitions.
See the mechanism before you memorize it
One diagram, one causal story, one reconstruction task.
Cheapest Flights Within K Stops (Bellman-Ford) — causal map
Frame
State the problem and the constraints before naming the technique.
Transform
Apply the core mechanism of Cheapest Flights Within K Stops (Bellman-Ford) and track what state changes.
Observe
Inspect the artifact, output, invariant, or behavior produced by the mechanism.
Transfer
Explain where the same idea appears elsewhere in DSA Patterns.
Draw the idea yourself
Rebuild the core flow on a real canvas before moving to the worked walkthrough.
Walk the system
Frame
State the problem and the constraints before naming the technique.
Transform
Apply the core mechanism of Cheapest Flights Within K Stops (Bellman-Ford) and track what state changes.
Observe
Inspect the artifact, output, invariant, or behavior produced by the mechanism.
Transfer
Explain where the same idea appears elsewhere in DSA Patterns.
Reconstruction card
Use the card as a generative note, not a summary to copy. Fill it from memory after the explanation.
TOPIC: Cheapest Flights Within K Stops (Bellman-Ford)
MODULE: Graphs
TYPE: practice problem
PROMPT
What problem does it solve?
What changes step by step?
What evidence proves it worked?
When would you choose something else?What usually goes wrong
Close the tab. Rebuild it from memory.
Read the question, answer aloud, then reveal.
What problem is Cheapest Flights Within K Stops (Bellman-Ford) designed to solve?Reveal answer
It addresses a recurring constraint inside Graphs. A strong answer names the input, the core mechanism, and the result rather than repeating the title.
What are the four stages of the mental model?Reveal answer
Frame the problem → transform the input/state → observe the evidence → transfer the idea to a new scenario.
Course Schedule: how does topological sort detect a cycle?Reveal answer
Kahn's BFS peels zero-indegree nodes. If processed count < total nodes, the leftover nodes form a cycle.
Pacific Atlantic: why reverse the search direction?Reveal answer
Start DFS from ocean borders and climb cells with height ≥ current — reaching a cell means water can flow from it to that ocean; intersection is the answer.
Make this idea travel.
Connect it next to: Why pattern-based learning beats grinding • Set up your mistakes log + template notebook • Your spaced revision calendar (Day 1 / 3 / 7 / 21) • Big-O intuition builder: visualize growth rates.