LeetCode Question

#787 Cheapest Flights Within K Stops

SWE coding Medium
Sign in to bookmark Original →

Question Details

LeetCode #787: Cheapest Flights Within K Stops. Difficulty: Medium. Topics: Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path. Asked at HTC in the last 6 months.

Topics

Dynamic Programming Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue) Shortest Path

More from Htc

LeetCode #509 Fibonacci Number LeetCode #605 Can Place Flowers LeetCode #118 Pascal's Triangle LeetCode #1512 Number of Good Pairs
← All Htc questions