Given a 2D list, edges,  which represents a bidirectional graph. Each vertex is labeled from $0$ to $n-1$, and each edge in the graph is represented as a pair, $[x_i, y_i]$, showing a bidirectional edge between $x_i$ and $y_i$. Each pair of vertices is connected by at most one edge, and no vertex is connected to itself.

Determine whether a valid path exists from the source vertex to the destination vertex. If it exists, return TRUE; otherwise, return FALSE.

Constraints:

• $1\leq$ n $\leq 10^2$

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

• edges[i].length $= 2$

• $0 \leq x_i,y_i \leq n-1$

• $x_i\ne y_i$

• $0\leq$ source, destination $\leq n - 1$

• There are no duplicate edges.

• There are no self-edges.

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 problem correctly:

We have a game for you to play. Rearrange the logical building blocks to better understand how to solve this problem.

Implement your solution in the following coding playground.