Shortest Path in a Grid with Obstacles Elimination | Live Coding with Explanation | Leetcode - 1293

[@geek_for_life]

Thank you for Explaining it in Crystal Clear Manner! 👍

[@AlgorithmsMadeEasy]

Glad it was helpful!

[@BruceyBit]

Great explanation! The graphics are extremely helpful!❤

[@AlgorithmsMadeEasy]

Glad it was helpful!

[@praveenugiri]

Good Intuition, thanks

[@AlgorithmsMadeEasy]

You are so welcome

[@shravsidol]

Great Explanation!

[@pradiptalekar7545]

Good one. Easy to understand and easy to implement. Thanks for sharing!!

[@shraddhashah7312]

Excellent explanation. Thank you👏

[@hiss30]

Thank you,I found this very helpful😊

[@AlgorithmsMadeEasy]

Glad it was helpful!

[@utkarshsharma1185]

thanks, mam your memoization approach is excellent and very intuitive compared to other methods like storing the count of k in the visited array to decide whether we should traverse this cell or not.

[@AlgorithmsMadeEasy]

Most welcome 😊

[@chetan_bommu]

Very clean & crisp explanation 👏

[@AlgorithmsMadeEasy]

Thanks!! Do share like and subscribe!!

[@raushankumar6993]

great explaination

[@AlgorithmsMadeEasy]

Glad you enjoyed it!

[@tung-hsinliu861]

easy to understand explanation :)

[@AlgorithmsMadeEasy]

Glad you enjoyed it!

[@gauranshverma5962]

great explanation and effort

[@jaideeppyne1880]

Well explained with pictures!

[@AlgorithmsMadeEasy]

Glad it was helpful! Don't forget to share and subscribe!!

[@vaibhavaren3217]

Awesomely expalined. Thanks a ton :D :D

[@AlgorithmsMadeEasy]

Glad it helped! Most welcome!! Don't forget to subscribe!!! :)

[@krishnaveerakishoremuppana9189]

Thanks for the visualization :)

[@manasawalaaamir]

great explanation

[@rjkal]

Very good explanation, better than most I've seen for this problem. I have one question - how do you know when to increment the step? I am trying to understand how you determine that? Also you mentioned for the 3D array it is [i, j, k+1]. Why k + 1? Please help me understand.

[@muhammadrehanalikhan1453]

Q "how do you know when to increment the step?" look at the inner while loop "while(size-- > 0) { }" you just need to count how many times this while loop is been called. First Call: the 'while loop' will process cell (0,0) and terminate Second Call: the 'while loop' will process all cells ONE step away from (0,0) Third Call: the loop will process all cells TWO steps away from (0,0).......AND SO ON that means number of while loop calls == number of steps taken. That is why she is incrementing step outside the end of this inner while loop. Q "Also you mentioned for the 3D array it is [i, j, k+1]. Why k + 1?" we are using k as one of the index of the visited array. An array of size == k has max index of k - 1. So we make the size == k + 1 so the max index is k. I hope this helps.

[@rjkal]

@@muhammadrehanalikhan1453 Thank you so much for the detailed explanation! That cleared my doubt. It is really helpful.

[@tusharnain6652]

Can't thank you enough.

[@AlgorithmsMadeEasy]

Glad you enjoyed it!

[@rahatsshowcase8614]

very nice

[@prasenjit_dutta]

Thankyou !!

[@khawla2583]

Thank you for the video, would you provide us with explanation on how to print the coordinates of the shortest path ?

[@venkatasriharsha4227]

I love the way u explain things. I don't know much about Java but I can clearly code it in python after seeing your explanation. Keep it up. You need more subscribers 😔 They're missing alot. I'll recommend it to my frnds from my side as a small gratitude. Make videos as frequently as possible 🙂

[@himanshunegi5228]

crystal clear

[@noobCoder26]

can i take vis[m][n ] instead of vis[m][n][k]? I didnt get the point of 3d array ie K

[@anilkatakam2738]

time limit exceeding

[@jainamshah3691]

When i am optimizing more by using distance matrix, why its giving wrong answer I am not able to understand that can you please explain I am using distance matrix like if the neighbour distance is already less than 1 + steps then i will not push it to the queue

[@kartikeykhosla8737]

One video on leetcode 73, ur's explanations are easy to understand

[@AlgorithmsMadeEasy]

Surely we will try to create a video on that... Keep sharing problems you wish to see videos on.

[@amruthaj4262]

Why should we take k+1 not just 'k' in the visited array? The code doesn't work if it's just k....I didn't understand this. Please explain.

[@atharvakulkarni3007]

mistake at 9:23 you've used 2,0 but on visualization you are on 0,2

[@giangkhuat9343]

hey does anyone know why we don't need to take into account the distance(number of steps) when checking if the current cell is visited ? we only need three elements ?

[@adarshkesarwani3384]

we are just interested in finding weather a particular cell is visited or not, how does it even matter at what step a particular cell got visited, we just if it is visited or not irrespective of steps count.

[@saunaknandi1814]

I used 3D - DP but its not working and giving stack overflow but why?

[@sarthakkumar856]

I have also used 3D-DP using recusion but I am getting wrong answer on 46th test case.

[@shashanksingh4708]

is this multi source bfs ?

[@raj2523]

Nope

[@shubamgoswami]

study material folder💦

[@yalslaus]

9:30 is wrong. you should be at (2,0)

[@budsyremo]

Can there be a scenario where there are two paths and one path is longer ? And if so what if the longer path shws up first ?

[@avinashchoubey3394]

longer path can never show up first in BFS. BFS traverses with one length increment in path so the shorter path is always processed first

[@sakshimishra1491]

not optimized. optimize before uploading it on youtube. don't dump anything and everything.

[@ThisisCuriousclue]

rubbish

[@Shanky_17]

what and how?