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.
Everyone's talking about using graph search algorithms. Isn't this problem best solved using DP (for O(n) run time)? Or am I missing some concept here?
Snakes and Ladders: The Quickest Way Up
You are viewing a single comment's thread. Return to all comments →
Hello,
Everyone's talking about using graph search algorithms. Isn't this problem best solved using DP (for O(n) run time)? Or am I missing some concept here?