Leetcode - Cheapest Flights Within K Stops (Python)

June 2020 Leetcode Challenge
Leetcode - Cheapest Flights Within K Stops

[@ployapinon6345]

I like how you shared a solution that failed on some test cases and showed how we can fix it. It helps me learn how to think of more edge cases.

[@arnabganguly4962]

Nice.You can use priority queue as well for Dijkstra's Algo.

[@timc3406]

Might need to check that out!

[@aayansrivastava7121]

why the number of stops taken initially is -1 and not 0?

[@banankulovski]

1 stop is equivalent to 2 edges in graph