We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I am only about to solve this problem but I think BFS is fine - all the edges in the graph have length of 1 (1 die roll to be precise) You should be fine doing BFS then.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Snakes and Ladders: The Quickest Way Up
You are viewing a single comment's thread. Return to all comments →
I am only about to solve this problem but I think BFS is fine - all the edges in the graph have length of 1 (1 die roll to be precise) You should be fine doing BFS then.