# Possible Bipartition: Study Guide
Possible Bipartition shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Color the dislike graph with two colors (BFS/DFS); a conflict means a bipartition is impossible.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n+e).
## Common mistake
Putting each dislike pair into opposite groups without propagating through connected components.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview copilot.