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
- L5
Interview Prompt
Given a graph as an adjacency list (graph[i] is the list of neighbors of node i), return True if the graph is bipartite (2-colorable).
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 your python solution with real code execution
- Get instant feedback and a hire/no-hire decision