Leetcode Question787. Cheapest Flights Within K Stops

Previous Solution Provided:Github Solution

New Solution Added :Submission Link

Neetcode video:YT Link

Your solution for both looks great!

However, I want to suggest a small edit for787. Cheapest Flights Within K Stops problem.

There is already a solution using Dijkstras, and it is also a valid way to solve it so we do not need to delete it. It is always good to keep other ways of solving a problem, but the first solution in the file should always be the one following the video. And use of commenting to avoid any confusion,

I would suggest that you edit the file to add yours while keeping the other solution. You can put yours first (Since it is the one following the video solution) and put the other solution below. They should be separated in twoSolution classes, should look something like this:

// Your solution here, bellman-ford....class Solution {    int findCheapestPrice() {        // ...    }}// Other solution here, dijkstras....class Solution {    int findCheapestPrice() {        // ...    }}

Thanks@a93a for the review I had done the necessary code changes.

Thank you@adityaiiitr ! I have merged this now.

@adityaiiitr Please feel free to create seperate PR for each Leetcode problem in the future, this makes it easier to read & review 😃