Snake and Ladder Problem (Graphs) | GeeksforGeeks

Find Complete Code at GeeksforGeeks Article: www.geeksforgeeks.org/snake-l...
This video is contributed by Anik Shah.
Please Like, Comment and Share the Video among your friends.
Install our Android App:
play.google.com/store/apps/de...
If you wish, translate into local language and help us reach millions of other geeks:
czcams.com/users/timedtext_cs_p...
Follow us on Facebook:
/ gfgvideos
And Twitter:
/ gfgvideos
Also, Subscribe if you haven't already! :)

[@kushalgupta9613]

This is the first gfg video that really has a good explanation tbh

[@gajendrapratapsingh4681]

1. need to update visited[] every time.
2. qentry a = new qentry(); should be declared before "if" condition.

[@karana2260]

better to add vertex inside if condition. i.e. shift q.add(a) inside if.

[@AmanSingh-fl3wp]

I guess in the for loop at last after adding the vertex to the queue you need to set the vertex as visited as well

[@algorithmimplementer415]

Great explanation. Do you have some more videos done by you?

[@chintalapativenkataramarahul]

Great explanation! Thanks!!

[@ankursuri3853]

Thanks for the video. Good explanation.

[@alokesh985]

Finally found a decent video explanation on the gfg CZcams channel!

[@uditkumar867]

Please show us the visualization of in terms of graph

[@Guddukumar-mk3bz]

I m a big fan of geeksforgeeks,it helps me alot in project and learning c. thanku a lot for this. When i saw, there is a CZcams channel for geeksforgeeks. I became very happy. I mean amazing.

[@parasuraman8848]

Bro aren't we need to set the visited[j]=1 ?

[@jaiprakashtoppo]

The elements of the array visited[ ] are not getting updated.

[@krushnasharma9031]

How do we handle moving to the left in a row. Let's say we are at location 7. The for loop will never run as i+1 will be out of bounds

[@aviraltandon1998]

Great Explanation

[@8750795655]

Nice explanation

[@sauravrana1432]

I find it difficult to understand why we are using BFS traversal and not DFS

[@DeepakKumar-yc9hr]

really is this code check minimum streps ?

[@vinjamurisatyakrishna3332]

yeah this won't give you minimum no of steps required.

[@furizz284]

Why can't we solve it using dfs ? can anyone pls explain that

[@vinjamurisatyakrishna3332]

you can.

[@dsaa2z]

Because it is a graph not tree.
We can calculate distance by dfs in case of tree.

[@rahgurung]

There is nothing called O(6), its just O(1) that you want to say.

[@engineerscode1316]

bhai sound thik se dalta to jyada baria rehta

[@prasannapm3220]

thank you pa

[@siddhantthacker5244]

Its not working for me

[@arijain6349]

depending on how ur input is formatted it won't work. if you get a matrix this won't work, you need to calculate what the position "35", or "15" actually represents in terms of rows and columns and implement it that way

[@arijain6349]

this video is nothing more than a higher level of abstraction of how to implement this.

[@karamveersingh8085]

bhai sara whiteboard chupale koi dekh na le