In this video, Liz breakdowns how to solve a graph problem she encountered in a real Google interview.
Challenge prompt:
You are tasked with splitting the 7th-grade class into two teams for a soccer game. Given a list of students and their “enemies” aka “the kids they can’t be on the same team as”, determine whether it is possible to split the class in two in such a way that no child is on the same team as any of their enemies. If possible, return the two teams.
This video covers:
0:43 Problem overview
2:34 Bipartite graphs
6:35 Graph coloring
13:42 Coding a solution
37:44 Recap
For more practice with graphs, check out our full series:
https://www.youtube.com/playlist?list=PLxQ8cCJ6LyOZliGURipQhb9NRza33Jgjs
Join over 600,000 developers who have used Coderbyte to practice with real coding interview questions by signing up at https://coderbyte.com/
