Sorry guys, video is a bit late today, it took some time to make notes for this one 🫡📝!!
@harshal87816 ай бұрын
Kaar diya maaf 😅
@rajrajesh16696 ай бұрын
It's alright bro, we are always grateful for your work and contribution to the coding community...
@ARYANMITTAL6 ай бұрын
😂😂
@ARYANMITTAL6 ай бұрын
🫂🫂
@rajrajesh16696 ай бұрын
Man, There's no way this problem can actually be solved using dijkstra's algo😢... Such a beautiful explanation as gulab jamun for the dijkstra's algo approach. Thanks a lot... My only qtn rn is How did you came up with this solution bro?😂
@ARYANMITTAL6 ай бұрын
Glad you loved Rajesh ❤️❤️
@nikhilbabar22266 ай бұрын
Great video !, one approach which I tried was dfs + dp
@gigachad2419Ай бұрын
TLE?
@ankitraheja9524Ай бұрын
What is the advantage of using PQ? Queue should have been enough. I ran the same program with PQ as well as Queue, did not find any difference in runtime. Can u please elaborate in this particular question what advantage PQ has brought? Thanks in Advance!!
@shashanksingh30082 ай бұрын
Dem how do you always know what I am gonna try and explain the correct way to overcome the problems i encountered after hours of head banging.
@ABHAYKUMAR-kt3ug6 ай бұрын
Aap pehle ki tarah video vale notes ki pdf description me daal diya karo plz
@surajshekhar176 ай бұрын
8:49
@ARYANMITTAL6 ай бұрын
💀💀🌚😂
@hrithikkumar79746 ай бұрын
why is the time complexity of bfs solution O(n+e.k)? if n=99 and k=100 then every node can be visited 2^(flights.size()) time right?
@fraserdab6 ай бұрын
If u said "smash the like button" at 35:40 then the like button would've glown, just a fun thing, thanks for the video
@ARYANMITTAL6 ай бұрын
Uff esaaa 🫠🫠❤️
@varadv36 ай бұрын
8:50 "maksad nahi bhulna guys" 🤣
@Anonymous-lb6mc6 ай бұрын
Great !! Thanks man!!
@ARYANMITTAL6 ай бұрын
❤️❤️🤌🏻🫂
@sumitrajan90306 ай бұрын
No problem bro 🤜
@ARYANMITTAL6 ай бұрын
🫡🫡🫂
@krishnasharma6576 ай бұрын
Dijkstra gives tle 😅
@chickukoshti37416 ай бұрын
not getting
@gourabchatterjee17786 ай бұрын
Just to mention your dijkstra's code is wrong..We cannot return distance when node==dst inside the loop....You messed up dijkstra's and bfs together
@ARYANMITTAL6 ай бұрын
Bro, I mentioned in video 6 times how it works, still you have a comment like this 🫠, and then people say, why i repeat stuff 🤣
@gourabchatterjee17786 ай бұрын
@@ARYANMITTAL Well you can actually repeat it for the 7th time but the code would still be wrong
@AkashKumar-bm4py6 ай бұрын
@@ARYANMITTAL Bro but it will search for other possible solutions as well ,which might be more optimum solution. In the example you just explored one path .
@shashanksingh30082 ай бұрын
@@gourabchatterjee1778 bro the code is completely right !! You can definitely return the distance because priority queue would have already set the lowest distance and lowest step which we actually want.