Snakes and Ladders

LeetCode 909 • Medium • Graphs • Anduril

n×n board, boustrophedon labels. BFS: from square x roll 1–6; take snake/ladder if present. Min moves to n².

TimeO(n²)

SpaceO(n²)

Cell

BFS

step—

note—

Speed:

Ready

Press Play to walk the algorithm.

Whiteboard

Size:3

Type It

snakesAndLadders(board) — minimum dice moves to finish (-1 if impossible).

═══ SNAKES & LADDERS (LC 909) ═══

PATTERN ▸ BFS on 1..n²

① map label → (r,c)

② BFS; next = dest or teleport

visit once

your implementation

Verify: