#522Easy· asked at 2 companies
Find if Path Exists in Graph
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: n = 3, edges = [[0,1],[1,2],[2,0]], source = 0, destination = 2 Output: true
Example 2
Input: n = 6, edges = [[0,1],[0,2],[3,5],[5,4],[4,3]], source = 0, destination = 5 Output: false
Constraints
- •
1 <= n <= 2 * 10^5 - •
0 <= edges.length <= 2 * 10^5 - •
edges[i].length == 2 - •
There are no duplicate edges or self-loops.