Darbar 145 — Cheapest Flights Within K Stops
Medium
Darbar · Graphs
Catalog slot 145 of 548 (source id 1026). Topic graphs / shortest path.
Solve on LeetCode: Cheapest Flights Within K Stops. Do not treat this page as a statement dump.
Aligned T2T band: weeks 46–57. Start at Week 46. Full map: Darbar hub.
Pattern block: State machines and simulations (weeks 16-30, slots 121-200). Warmup: Simulation and state-transition drills. Exam: 2-3 state-machine problems in 60 minutes.
Also filed under: graphs / dp based, heap / dp based, heap / graph based.
Triangulation — Graphs: Darbar speed is BFS/DFS and shortest paths; Forge depth is SCC, flow, matching, min-cost flow; production artifact is Workflow and routing platform.
Evidence (cookiecutter problem_145.md)
- Attempt log (approaches that failed)
- Final complexity (time and space)
- One mistake corrected
- Production concept this slot reinforces
Personal dates and the CSV tracker stay in the learner journal.
Same subtopic
- Evaluate Division · medium
- Find The City With The Smallest Number Of Neighbors At A Threshold Distance · medium
- Network Delay Time · medium
- Number Of Ways To Arrive At Destination · medium
Darbar slot 145 of Tensor-to-Tenant · Previous · Next.