Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Advanced graph algorithms

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Advanced graph algorithms

Cheapest Flights Within K Stops

advancedlayer A3 · Advanced graph algorithms5 tests

There are n cities labelled 0 to n - 1 and a list of flights, each [from, to, price]. Return the cheapest price from src to dst using at most k stops, or -1 if no such route exists.

  • 'At most k stops' means at most k + 1 flights — the intermediate cities are the stops
  • Plain Dijkstra is wrong here: the cheapest way to reach a city may use too many flights, and a pricier route with fewer flights can still win
  • src === dst costs 0
  • A compact MinHeap keyed on item[0] is already written for you in the starter — spend your effort on the algorithm

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen