For the problem Graph-Isomorphism the Editorial provided was BruteForce and I checked some other coders' solutions, they were the same.
But what the problem basically saying is that check if both are Isomorphism or not
And as by the constraint we know the number of vertices and the edges for both parties are same, So can't we just check if they have a similar Degree Sequence or not ?
I tried solving using Degree Sequence logic but it was failed in just 1 test case.
I want to know if Degree Sequence logic can't be applied then why? I am confused, Please Kindly anyone explain.