Cheapest Flights Within K Stops

1. 1
   Learn the pattern

   Weighted edges → Dijkstra; connectivity questions → Union-Find; DAG ordering → topological sort.

2. 2
   Trace your version

   Paste your solution into the workspace and watch every step execute.

   Open workspace
3. 3
   Solve it

   Solve it on LeetCode, then mark it solved here to keep your streak alive.

   Solve on LeetCode Mark solved