Leetcode 909. Snakes and Ladders

Treat the boustrophedon-labeled board as a 1D graph of squares where from any square you can move 1–6 steps (dice roll), but landing on a cell with a snake or ladder teleports you to its destination; find the minimum number of rolls to reach n^2 using BFS (or return -1 if unreachable).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 909. Snakes and Ladders

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact