Find if Path Exists in Graph · Coding Interview Practice

Find if Path Exists in GraphGiven n vertices labelled 0 to n - 1 and a list of undirected edges, determine whether there is a path from source to destination.Constraints

1 <= n <= 2 * 10^5

0 <= edges.length <= 2 * 10^5

No self-loops and no duplicate edges

Examples

Input: n = 3, edges = [[0, 1], [1, 2], [2, 0]], source = 0, destination = 2 Output: true

Input: n = 6, edges = [[0, 1], [0, 2], [3, 5], [5, 4], [4, 3]], source = 0, destination = 5 Output: false

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…