Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 886. Possible Bipartition
Given n people and pairwise dislikes, determine whether the corresponding undirected graph is bipartite — i.e., whether you can 2-color all vertices (split into two groups) so no dislike pair lies within the same group (n ≤ 2000, dislikes ≤ 10^4).
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early April, 2025
Mid-level
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.