Can some user with coach mode provide me test case 10 for this problem? My Solution.
I am finding the maximum distance from one of the extremes and then printing all the vertices in the order of distances.
Please correct me, If am wrong!.
Thanks!
Here you go
7 5
6 3
7 3
3 1
1 5
2 4
Participant's output
2 4 1 3 5 6 7
Jury's answer
6 7 3 1 2 4 5
Checker comment
wrong answer Not topsort: 6,3 -> 6,4