Public Notes
on

histre
Find if Path Exists in Graph - LeetCode
leetcode.com

Can you solve this real interview question? Find if Path Exists in Graph - There is a bi-directional graph with n vertices, where each vertex is labeled from 0 to n - 1 (inclusive). The edges in the graph are represented as a 2D integer array edges, where each edges[i] = [ui, vi] denotes a bi-directional edge between vertex ui and vertex vi. Every vertex pair is connected by at most one edge, and no vertex has an edge to itself.

You want to determine if there is a valid path that ex...

#leetcode #coachable #graph #dev #difficulty:easy

Show More

Collect and share the web

Get started for free