Copied to Clipboard
Bipartite Graph
Medium Accuracy: 40.1% Submissions: 62810 Points: 4

Given an adjacency list of a graph adj  of V no. of vertices having 0 based index. Check whether the graph is bipartite or not.

Example 1:


Output: 1
Explanation: The given graph can be colored 
in two colors so, it is a bipartite graph.

Example 2:


Output: 0
Explanation: The given graph cannot be colored 
in two colors such that color of adjacent 
vertices differs. 


Your Task:
You don't need to read or print anything. Your task is to complete the function isBipartite() which takes V denoting no. of vertices and adj denoting adjacency list of the graph and returns a boolean value true if the graph is bipartite otherwise returns false.


Expected Time Complexity: O(V + E)
Expected Space Complexity: O(V)

1 ≤ V, E ≤ 105

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Bipartite Graph

Output Window