Available question text
Determine whether the graph on array indices with an edge between i and j iff gcd(nums[i], nums[j]) > 1 is fully connected. With nums and n up to 1e5 the core challenge is efficiently checking connectivity (typically via union-find over shared prime factors rather than O(n^2) pairwise gcds).
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 · 1 record
No company association
Leetcode 2709. Greatest Common Divisor Traversal
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source