Darbar 260 — Cheapest Flights Within K Stops
Medium
Darbar · Heap
Catalog slot 260 of 548 (source id 814). Topic heap / dp based.
Solve on LeetCode: Cheapest Flights Within K Stops. Do not treat this page as a statement dump.
Aligned T2T band: weeks 31–45. Start at Week 31. Full map: Darbar hub.
Pattern block: Tree and graph fluency (weeks 31-45, slots 201-280). Warmup: Tree traversals and adjacency-list graph walks. Exam: Tree+graph block with one design flavored problem.
Also filed under: graphs / dp based, graphs / shortest path, heap / graph based.
Triangulation — Heap: Darbar speed is Top-K and scheduler problems; Forge depth is Heap invariants and adversarial streams; production artifact is Streaming Top-K / inference batching.
Evidence (cookiecutter problem_260.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
- Super Ugly Number · medium
- Ugly Number Ii · medium
- Two Best Non Overlapping Events · medium
- Jump Game Vi · medium
Darbar slot 260 of Tensor-to-Tenant · Previous · Next.