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 have the same issue in bash. I tried very different inputs and all of them seems to generate the correct output, with the new line between each test case... the -1 for unreachable nodes... nothing mentioned in the description about what to be returned if two different paths with the same length are found in the graphs.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Dijkstra: Shortest Reach 2
You are viewing a single comment's thread. Return to all comments →
I have the same issue in bash. I tried very different inputs and all of them seems to generate the correct output, with the new line between each test case... the -1 for unreachable nodes... nothing mentioned in the description about what to be returned if two different paths with the same length are found in the graphs.