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.
Hardest medium problem in hackerrank! lol
Optimization: BFS from top to bottom and from bottom to top, one level each. This will cut the tree in a half.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Gena Playing Hanoi
You are viewing a single comment's thread. Return to all comments →
Hardest medium problem in hackerrank! lol Optimization: BFS from top to bottom and from bottom to top, one level each. This will cut the tree in a half.