Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Contain Virus
Coding · Array · Breadth-First Search · Depth-First Search
- Escape the Spreading Fire
Coding · Array · Binary Search · Breadth-First Search
- Find the Safest Path in a Grid
Coding · Array · Binary Search · Breadth-First Search
- Making A Large Island
Coding · Array · Breadth-First Search · Depth-First Search
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 909. Snakes and Ladders
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Tesla
Snakes and Ladders
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source