Detect cycle in an undirected graph

**AIM:**

This is the GFG problem Medium Level
Given an undirected graph with V vertices and E edges, check whether it contains any cycle or not.

**Please Assign this to me under LGM SOC .**

**Details**

We have to write the code 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.

### Programming language

- [x] C++