The Bipartite Test
A medium Python mock interview question on DataDriven, with an AI interviewer who asks follow-up questions and a hire or no-hire decision at the end.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L5
Interview Prompt
A scheduling conflict graph arrives as `adj_list`, where entry `i` lists the nodes that clash with node `i`. Return whether the nodes can be divided into two groups so that no clash falls inside a group.
Summary
Can this crowd be split into two perfectly separated groups?
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write and run your Python against test cases
- Answer the interviewer's follow-up questions, then get a hire or no-hire decision