You are given an integer n denoting the number of vertices in an undirected graph, with vertices numbered from $0$ to n $- 1$. You are also given a $2$D integer array edges where each edges[i] $= [a_i, b_i]$ indicates an undirected edge connecting vertices $a_i$ and $b_i$.

A connected component is considered complete if every pair of vertices within that component is connected by an edge.

Return the total number of complete connected components in the given graph.

Constraints:

• $1 \leq$ n $\leq 50$

• $0 \leq$ edges.length $\leq$ n $\times$(n $- 1) / 2$

• edges[i].length $= 2$

• $0 \leq a_i, b_i \leq$ n $- 1$

• $a_i \neq b_i$

• There are no repeated edges.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.