PYTHON PROBLEM 324 · Interview-Level

Find cheapest flight with stop limit: Stop limit blocks route

Return the direct price when a cheaper multi-edge route uses too many stops.

Bellman-Ford · bounded shortest path · company screenBellman-Fordbounded shortest pathcompany screen

PROBLEM OVERVIEW

What this Python exercise asks you to practise

This scenario tests find cheapest flight with stop limit. It belongs to the Graphs and Connectivity roadmap and uses the bellman-ford · bounded shortest path · company screen pattern.

Graph representation, BFS, DFS, shortest paths, topological order, and union-find.

COMPLETE WORKSPACE

Learn the plan, trace the logic and run the solution

Complete access unlocks the full statement, input and output examples, visual execution plan, hints, browser compiler, solution and line-by-line interpretation.

Unlock all 360 problems · ₹599One full year · one payment · no automatic renewal

SKILL TO CARRY FORWARD

Pattern relevance

This exercise strengthens bellman-ford · bounded shortest path · company screen. Be ready to explain the input, the rule, the boundary cases, and why the chosen approach is appropriate.