Problem: Find if Path Exists in Graph

Statement

You are given a bidirectional graph consisting of n vertices, labeled from $0$ to $n - 1$ (inclusive). The graph’s edges are provided as a $2$D integer array edges, where each edges[i] $= [u_i, v_i]$ represents a bidirectional edge between vertex $u_i$ and vertex $v_i$ ...