Available question text
Given unique positive integers, build a graph connecting numbers that share a common factor >1 and return the size of the largest connected component — this is typically solved by factorizing each number and using union-find (or grouping) over prime factors to efficiently cluster numbers (nums.length ≤ 2e4, nums[i] ≤ 1e5).
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 952. Largest Component Size by Common Factor
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source