There is a bi-directional graph with n vertices labeled 0 to n - 1. You are given edges where edges[i] = [u, v] denotes an edge between u and v.
Return true if there is a valid path from source to destination, otherwise false.
We use analytics and advertising cookies to understand how the site is used and whether our ads on Facebook and Instagram work. They are set only if you accept. See our Privacy Policy for details.
There is a bi-directional graph with n vertices labeled 0 to n - 1. You are given edges where edges[i] = [u, v] denotes an edge between u and v.
Return true if there is a valid path from source to destination, otherwise false.
A medium graphs problem, graded against 7 test cases (5 of them hidden).
Nodes and edges - traversal, connectivity, cycles, and shortest paths.
Reach for it when you see: Explicit edges, a grid treated as a graph, or dependencies between items.
More Graphs problems →Union-Find (Disjoint Set Union). Union every edge, then check whether source and destination have the same representative. Path compression keeps each `find` near O(1) amortized.
Time: O((n + e)·α(n)). Space: O(n).
The full reference solution in every supported language stays in the editor above - reveal it there once you have had a real attempt.
Read off this problem's own test suite, so these are the cases a submission actually has to survive.
These apply to the pattern as a whole, not just this problem.