There are n cities connected by flights, where flights[i] = [from, to, price]. Given src, dst and k, return the cheapest price from src to dst with at most k stops (k stops means at most k+1 flights)…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.