Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Possible Bipartition

n people are labelled 1..n and some pairs dislike each other. Print true if the people can be split into two groups so that no two people who dislike each other are in the same group.

Constraints

1 <= n <= 2000 0 <= m <= 10^4

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.