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