#787 Cheapest Flights Within K Stops
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.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a reported interview question from a htc interview for a swe role during the coding round.
It covers the following topics: Breadth-First Search, Depth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path, Dynamic Programming, Graph, Heap, Queue .
Difficulty rating: Medium