STATUS
• Solved
• Unsolved

Showing:
Handle Score
@Ibrahim Nash 6420
@mb1973 5594
@Quandray 5231
@akhayrutdinov 5111
@saiujwal13083 4510
@sanjay05 3762
@kirtidee18 3673
@marius_valentin_dragoi 3522
@sushant_a 3459
@verma_ji 3412
Detect cycle in an undirected graph
Medium Accuracy: 35.66% Submissions: 71718 Points: 4

Given an undirected graph with V vertices and E edges, check whether it contains any cycle or not.

Example 1:

Input:

Output: 1
Explanation: 1->2->3->4->1 is a cycle.


Example 2:

Input:

Output: 0
Explanation: No cycle in the graph.


You don't need to read or print anything. Your task is to complete the function isCycle() which takes V denoting the number of vertices and adjacency list as input parameters and returns a boolean value denoting if the undirected graph contains any cycle or not.

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

Constraints:
1 ≤ V, E ≤ 105

to report an issue on this page.

Editorial

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