Handle
|
Score
|
|---|---|
| @Ibrahim Nash | 6560 |
| @blackshadows | 6400 |
| @mb1973 | 5777 |
| @Quandray | 5275 |
| @akhayrutdinov | 5111 |
| @saiujwal13083 | 5074 |
| @kirtidee18 | 4409 |
| @sanjay05 | 3762 |
| @mantu_singh | 3666 |
| @gfgaccount | 3605 |
| @marius_valentin_dragoi | 3525 |
| Complete Leaderboard | |
|
Handle
|
Score
|
| @anish5256 | 991 |
| @vimleshpratapsingh321 | 980 |
| @skj7 | 953 |
| @kanewilliamson123 | 894 |
| @pradeeppatidar1999 | 868 |
| @akhileshkumar562002 | 862 |
| @wallflowe101 | 826 |
| @pd420786 | 813 |
| @infilooop | 800 |
| @nikhilkushwah280 | 796 |
| @bunnybug320 | 796 |
| Complete Leaderboard | |
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:
Problem of the Day
Problem of the Day
Input:
Output: 1
Explanation: The given graph can be colored
in two colors so, it is a bipartite graph.
Example 2:
Input:
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 graph and returns a boolean value true if graph is bipartite otherwise returns false.
Expected Time Complexity: O(V)
Expected Space Complexity: O(V)
Constraints:
1 ≤ V, E ≤ 105
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes
