Hey guys !
So I was trying to hack a solution using this test case in Distinct routes.
Problem link .
3 5
1 2
1 2
1 2
2 3
2 3
The answer should be
2
3
1 2 3
3
1 2 3
But I got INVALID INPUT .
I think this input should be valid as per constraints .
Hey guys !
So I was trying to hack a solution using this test case in Distinct routes.
Problem link .
3 5
1 2
1 2
1 2
2 3
2 3
The answer should be
2
3
1 2 3
3
1 2 3
But I got INVALID INPUT .
I think this input should be valid as per constraints .
You can't have multiple instances of
1 2in your input.Okay understood . I was thinking 1 1 is not valid .
"There are no two teleporters whose starting and ending room are the same." This means multi-edges are not allowed.
Okay understood .