algorithms.tutorialhorizon.com
Snake and Ladder Problem | Algorithms
Given a snake and ladder game, write a function that returns the minimum number of jumps to take top or destination position. You can assume the dice you throw results in always favor of you means you can control the dice