if "1,2,3,4" are cities, then how come the distance between 2 cities change when the direction is reversed? The distance should be same both ways. Like "1 -> 3 = 15" but "3 -> 1 = 6". This is mentioned in your question. The question itself is wrong.

Hi Mr. Abdul. First of all I want to thank you for your videos because they are very straight forward and easy to understand. I have a small doubt. In this kind of optimization problem, how is DP helping to reduce computations ? I mean we are calculating costs starting from bottom leaf nodes and calculating cost for all paths. In a real world scenario using Google Maps this will lead to a large number of calculations and we are not using anything to avoid certain path calculations to save computation cycles.

Sir u r teaching very useful for me tq so much and this TSP it has 1 small mistake g(2,{3} )=15 but g(2,{4})=18, g(3,{2})=18and so on… But u just consider only 1vetex only that is mistake

Please include this video into playlist "algorithm"

after 11:17m problem

I think you've mistaken sir from g(2,{4})=18 to g(4{3})=15 ðŸ¤”ðŸ¤”

9:26 rip

Sir thq

Your values are wrong when using dynamic programing

Watching this a night before ADA exam . Wish me luck

you are making it from hard way

Well understood by this video

Great ……

Sir can you explain the time complexity in solving this problem?

Can you make a video on inventory transshipment problem for individual retailers in the system ?

There are mistakes in it.But no problem

How many of you are watching it before your Exam ??ðŸ˜†ðŸ¤£ #DAA

Where did "{-k}" go when applying the formula on the tree…

whoever is reading go through comments there is some small error..

Great explanations!!

thank you sir.

I don't understand how this isn't brute force. Aren't we calculating every subtree in the end anyways?

if "1,2,3,4" are cities, then how come the distance between 2 cities change when the direction is reversed? The distance should be same both ways. Like "1 -> 3 = 15" but "3 -> 1 = 6". This is mentioned in your question. The question itself is wrong.

https://www.youtube.com/watch?v=-cLsEHP0qt0 the question used here is correct.

Why subtract -{k} ??

Thank you sir understood this very clearly. Except for that small mistake of g(2,{4}) everything is explained well and fine. âš¡

But whats the time complexity of this algorithm

Lol. No code at all.

sir plz explain their respective algorithmz plz sir

Hi Mr. Abdul. First of all I want to thank you for your videos because they are very straight forward and easy to understand. I have a small doubt. In this kind of optimization problem, how is DP helping to reduce computations ? I mean we are calculating costs starting from bottom leaf nodes and calculating cost for all paths. In a real world scenario using Google Maps this will lead to a large number of calculations and we are not using anything to avoid certain path calculations to save computation cycles.

much helpful….thanks sir.

You know you will top when sir abdul bari is there. Thx sir

Masha Allah your teaching very nice sir…,

Thanks a lot for these wonderful videos.

Basit Sir I am able to understand why we are subtracting {K} to g(k,{2,3,4})

isn't this traversal DFS with memoization?

Some data are wrong u r filling sir. Please recheck the method u r solving. Your final answer is correct.

Sir u r teaching very useful for me tq so much and this TSP it has 1 small mistake g(2,{3} )=15 but g(2,{4})=18, g(3,{2})=18and so on… But u just consider only 1vetex only that is mistake

g(2),{3} will be =6 , that is wrong in video.

g(3,{4})=20…but uh hv written 8..that's wrong……

Sir,

how to solve when matrix 5*5 , how to split it in further levels ?

thank you sir finally I understand how to solve this types of problem ….ðŸ˜Š