Cheapest Flights Within K Stops (LeetCode 787)
MediumLeetCode 787 · BFS · Google, Amazon +16 · 31:54Cheapest Flights Within K Stops · GOOGLE · BFS · Explanation ➕ Live CodingMy notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 787 Cheapest Flights Within K Stops by codestorywithMIK: Graphs, Medium. Topics: Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path
- Patterns
- BFS, Shortest Path (Dijkstra/Bellman/Floyd)
- Chapter
- Graphs
- Duration
- 31:54