Available question text
Given an undirected graph (n up to 2×10^5) as an edge list, determine whether there exists any path between the given source and destination vertices — a connectivity check typically solved with graph traversal or union‑find in O(n + m) time.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 3 records
Meta
Leetcode 1971. Find if Path Exists in Graph
Reported Oct 3, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceMicrosoft
Leetcode 1971. Find if Path Exists in Graph
Reported Jan 17, 2026 · 2 source reports
SENIOR
Source snapshot: Nov 12, 2026
View sourceWhatnot
Leetcode 1971. Find if Path Exists in Graph
Reported Sep 24, 2026 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source