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.
The test cases are not well formed, they are bad input.
For example Test case 1
1
70 1988
30 32
50 9
7 58
50 66
38 13
31 67
2 30
14 46
54 34
10 7
25 66
20 18
1 21
49 63
39 20
55 5
3
Says there are 1988 vertexes to read wich is clearely incorrect.
Test case 7 is missing the last single int representing the starting node, and so on.
Please fix the test cases.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
BFS: Shortest Reach in a Graph
You are viewing a single comment's thread. Return to all comments →
The test cases are not well formed, they are bad input. For example Test case 1 1 70 1988 30 32 50 9 7 58 50 66 38 13 31 67 2 30 14 46 54 34 10 7 25 66 20 18 1 21 49 63 39 20 55 5 3 Says there are 1988 vertexes to read wich is clearely incorrect. Test case 7 is missing the last single int representing the starting node, and so on. Please fix the test cases.