PYTHON PROBLEM 337 · Company Medium

Find cheapest flight with stop limit: Cheaper one-stop route

Choose a cheaper route that uses one allowed stop.

Model vertices and edges → select traversal or shortest-path strategyBellman-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 Top Company Graphs and Union-Find roadmap and uses the model vertices and edges → select traversal or shortest-path strategy pattern.

Solve connectivity, dependency, weighted-path, and ordering problems with graph algorithms.

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

INTERVIEW CONTEXT

Skills and reported company tags

Interview platforms and learner reports associate this problem family with the companies below. Tags are preparation signals, not a guarantee that an identical question will appear.

AmazonGoogleMetaMicrosoft