Day 14 of June LeetCode Challenge

Aanchal Patial
1 min readJun 14, 2020

There are n cities connected by m flights. Each flight starts from city u and arrives at v with a price w.

Now given all the cities and flights, together with starting city src and the destination dst, your task is to find the cheapest price from src to dst with up to k stops. If there is no such route, output -1.

--

--

Aanchal Patial

We never really grow up, we only learn how to act in public