← Back to problem library
Problem detail
787. Cheapest Flights Within K Stops
MediumDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)Shortest Path
Use this page to open the original problem, record a review, and keep the reasoning you want to remember for the next attempt.
Review history
No review history yet. Record your first attempt after solving this problem.