Loading interview...
The Bipartite Test
A medium Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- medium
- Seniority
- senior, staff
Interview Prompt
A matching platform needs to verify that its user-interest graph can be split into two groups with no intra-group connections - a property required for certain matching algorithms. Given an adjacency list as a list of lists, write a function that returns True if the graph is bipartite.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision