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.
In case the problem was more generalized, say that the level we start from will also be given as input (and not LEVEL 1 by default as in this problem), would we get the solution by using All-Pairs-Shortest-Path and our answer would be count of all the edges having weight equal to the maximum weight in the graph?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Super Mancunian
You are viewing a single comment's thread. Return to all comments →
In case the problem was more generalized, say that the level we start from will also be given as input (and not LEVEL 1 by default as in this problem), would we get the solution by using All-Pairs-Shortest-Path and our answer would be count of all the edges having weight equal to the maximum weight in the graph?