AppleCodingMembers
Cheapest Flights Within K Stops
Members only
There are n cities connected by some flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates a flight from city fromi to city toi with cost pricei.
SWE
hard
graph
shortest-path
bellman-ford
Frequency
Single report
Last asked
2026-04-25
Stage
phone-screen
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...
