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.
Maybe for a shallow understanding of the problem. Breadth first search and Depth first search algoriths are rather complex to fully appreciate the time complexity involved and its limits in terms of path finding.
Let's just say I wouldn't give a begineer this problem, I would start with more fundamental concepts and build up from theres.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Castle on the Grid
You are viewing a single comment's thread. Return to all comments →
Maybe for a shallow understanding of the problem. Breadth first search and Depth first search algoriths are rather complex to fully appreciate the time complexity involved and its limits in terms of path finding.
Let's just say I wouldn't give a begineer this problem, I would start with more fundamental concepts and build up from theres.