Bipartite Graph - Google Top Interview Questions
Problem Statement :
Given an undirected graph represented as an adjacency list, return whether the graph is bipartite.
Constraints
n, m ≤ 250 where n and m are the number of rows and columns in graph
Example 1
Input
graph = [
[1],
[0]
]
Output
True
Explanation
This is bipartite since the node 1 can belong in set A and node 2 can belong in set B. Then the edges 0 -
> 1 and 1 -> 0 has one node in A and one node in B
Example 2
Input
Visualize
graph = [
[2, 3],
[2, 3],
[0, 1],
[0, 1]
]
Output
True
Explanation
0 and 1 can belong in set A and 2 and 3 can belong in set B.
Example 3
Input
graph = [
[1, 2, 3],
[0, 2],
[0, 1, 3],
[0, 2]
]
Output
False
Explanation
No matter how the nodes are partitioned, an edge will belong to the same set.
Solution :
Solution in C++ :
bool isbipartite(vector<vector<int>> &graph, int src, vector<int> &color) {
for (int i = 0; i < graph[src].size(); i++) {
if (color[graph[src][i]] == -1) {
color[graph[src][i]] = !color[src];
if (!isbipartite(graph, graph[src][i], color)) return false;
} else if (color[graph[src][i]] == color[src])
return false;
}
return true;
}
bool solve(vector<vector<int>> &graph) {
// DFS by coloring nodes.
// Color root by R and subsequent by Blue if we found neighbour with same color it is not BPG.
vector<int> colors(graph.size(), -1);
for (int i = 0; i < graph.size(); i++) {
if (colors[i] == -1) {
colors[i] = 1;
if (!isbipartite(graph, i, colors)) return false;
}
}
return true;
}
Solution in Java :
import java.util.*;
class Solution {
private Set<Integer> visitedSet = new HashSet();
private Set<Integer> seta = new HashSet();
private Set<Integer> setb = new HashSet();
private boolean isBipartite = true;
public boolean solve(int[][] graph) {
if (graph == null || graph.length == 0)
return false;
for (int i = 0; i < graph.length; i++) {
if (!visitedSet.contains(i)) {
if (!isBipartite)
break;
;
dfs(graph, i, -1, 0);
}
}
return isBipartite;
}
private void dfs(int[][] graph, int vertex, int parent, int setIdentifier) {
addToSet(vertex, setIdentifier);
int[] adj = graph[vertex];
if (!isBipartite)
return;
for (int adjVertex : adj) {
if (adjVertex != parent) {
if (setIdentifier == 0 && seta.contains(adjVertex)) {
isBipartite = false;
return;
}
if (setIdentifier == 1 && setb.contains(adjVertex)) {
isBipartite = false;
return;
}
if (!seta.contains(adjVertex) && !setb.contains(adjVertex))
dfs(graph, adjVertex, vertex, (setIdentifier == 0 ? 1 : 0));
}
}
}
private void addToSet(int vertex, int setIdentifier) {
visitedSet.add(vertex);
if (setIdentifier == 0)
seta.add(vertex);
else
setb.add(vertex);
}
}
Solution in Python :
class Solution:
def solve(self, arr):
n = len(arr)
color_start = 1
seen = {}
def can_split(node, color):
if node in seen:
return seen[node]
seen[node] = color
for nei in arr[node]:
if nei not in seen:
if not can_split(nei, -color):
return False
elif seen[nei] != -color:
return False
return True
for i in range(n):
if not can_split(i, color_start):
return False
return True
View More Similar Problems
Self Balancing Tree
An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ
View Solution →Array and simple queries
Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty
View Solution →Median Updates
The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o
View Solution →Maximum Element
You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each
View Solution →Balanced Brackets
A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra
View Solution →Equal Stacks
ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of
View Solution →