### PROBLEM LINK:

**Author:** shakil ahmed

### DIFFICULTY:

EASY-MEDIUM

### PREREQUISITES:

Graph

### PROBLEM:

In this Problem there is given a graph with ‘V’ vertexes and ‘E’ edges . Your task is to find there exists a euler circuit or not.

### QUICK EXPLANATION:

This is straight forward Euler circuit problem. Euler circuit is a path that starts from any node , uses every edge of a graph exactly once and then finishes at same starting node. Solution ticks also mention in the problem statement. One of the tricky case is check the graph is connected or not.

### AUTHOR’S SOLUTIONS:

Author’s solution can be found here.