Solve problems that are commonly asked in C++ coding interviews related to common data structures.

Ace the C++ Coding Interview

Data structures are among the fundamentals of computer science and are often a core decision in developing efficient programs. They are categorized as a vital benchmark of computer science knowledge when it comes to industry interviews. This module contains a detailed review of common data structures in C++. We'll also become well-equipped with different data structures by implementing them.
By the end of this module, we'll have expertise in solving problems in data structures.

Data Structures

# Statement
Given a directed graph, check whether the graph contains a cycle and return a boolean value accordingly. 

A cycle occurs when you can start at one vertex, follow a path through the edges, and return to the starting vertex. This means at least one vertex is visited more than once within the same traversal path.

> **Note:** Edges list is interpreted in the following manner:
>
>edges = [[0, 2, 1], [], [2, 1, 0]] 
>
>Interpretation: 
>
>$0: 0, 2, 1$\
>$1:$ None\
>$2: 2, 1, 0$

**Constraints:**

If `n` is the number of nodes in the graph.
* `n` $== edges.length$
* $0 \leq$ `n` $\leq 100$
* $0$ $\leq$ `edges[i]` $\leq$ $n$ 

# Examples

 Try to solve the Detect Cycle in a Directed Graph problem.

Challenge: Detect Cycle in a Directed Graph

Try to solve the Detect Cycle in a Directed Graph problem.

Challenge 3: Detect Cycle in Graph

Statement