Practice Cheapest Flights Within K Stops
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Cheapest Flights Within K Stops
Problem Statement
There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city fromi to city toi with cost pricei. You are also given three integers src, dst, and k, return the cheapest price from src to dst with at most k stops. If there is no such route, return -1.
Source: Cheapest Flights Within K Stops on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
n = 4, flights = [[0,1,100],[1,2,100],[2,0,100],[1,3,600],[2,3,200]], src = 0, dst = 3, k = 1
700
# Example 2
n = 3, flights = [[0,1,100],[1,2,100],[0,2,500]], src = 0, dst = 2, k = 1
200
# Example 3
n = 3, flights = [[0,1,100],[1,2,100],[0,2,500]], src = 0, dst = 2, k = 0
500
Constraints
Related LeetCode Problems
Practice more problems similar to Cheapest Flights Within K Stops.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.