Fetching algorithms...

Bellman-Ford | Cheapest Flight | Rulcode

28. Bellman-Ford | Cheapest Flight

PRO

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: n = 4, flights = [[0,1,100],[1,2,100],[2,0,100],[1,3,600],[2,3,200]], src = 0, dst = 3, k = 1

Output: 700

Explanation: The cheapest path from city 0 to city 3 with at most 1 stop is 0 -> 1 -> 3 with a cost of 100 + 600 = 700.

Example 2:

Input: n = 3, flights = [[0,1,100],[1,2,100],[0,2,500]], src = 0, dst = 2, k = 1

Output: 200

Explanation: The cheapest path from city 0 to city 2 with at most 1 stop is 0 -> 1 -> 2 with a cost of 100 + 100 = 200.

Example 3:

Input: n = 3, flights = [[0,1,100],[1,2,100],[0,2,500]], src = 0, dst = 2, k = 0

Output: 500

Explanation: The cheapest path from city 0 to city 2 with at most 0 stops is 0 -> 2 with a cost of 500.

Constraints:

Time Complexity

O(VE)

Space Complexity

O(V)

Loading problem details...

rulcode

28. Bellman-Ford | Cheapest Flight

PRO

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: n = 4, flights = [[0,1,100],[1,2,100],[2,0,100],[1,3,600],[2,3,200]], src = 0, dst = 3, k = 1

Output: 700

Explanation: The cheapest path from city 0 to city 3 with at most 1 stop is 0 -> 1 -> 3 with a cost of 100 + 600 = 700.

Example 2:

Input: n = 3, flights = [[0,1,100],[1,2,100],[0,2,500]], src = 0, dst = 2, k = 1

Output: 200

Explanation: The cheapest path from city 0 to city 2 with at most 1 stop is 0 -> 1 -> 2 with a cost of 100 + 100 = 200.

Example 3:

Input: n = 3, flights = [[0,1,100],[1,2,100],[0,2,500]], src = 0, dst = 2, k = 0

Output: 500

Explanation: The cheapest path from city 0 to city 2 with at most 0 stops is 0 -> 2 with a cost of 500.

Constraints:

Time Complexity

O(VE)

Space Complexity

O(V)

28. Bellman-Ford | Cheapest Flight

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

28. Bellman-Ford | Cheapest Flight

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases