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

To support us you can donate

Check out our other popular playlists:
Questions you might like:

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode

[geek_for_life]

Thank you for Explaining it in Crystal Clear Manner! 👍

[BruceyBit]

Great explanation! The graphics are extremely helpful!❤

[pradiptalekar]

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

[atharvakulkarni]

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

[utkarshsharma]

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.

[khawla]

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

[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.

[vaibhavaren]

Awesomely expalined. Thanks a ton :D :D

[amruthaj]

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.

[jainamshah]

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

[venkatasriharsha]

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 🙂

[noobCoder]

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

[yalslaus]

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

[kartikeykhosla]

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

[giangkhuat]

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 ?

[sardarji]

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

[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 ?

[sakshimishra]

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