Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2709. Greatest Common Divisor Traversal
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.