There are n cities connected by flights. Given an array flights where flights[i] = [from_i, to_i, price_i], find the cheapest price from src to dst with at most k stops.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.