Given an array of unique positive integers, connect two numbers if they share a common factor greater than 1. Return the size of the largest connected component.
Example: returns . - and share factor - and share factor - and share factor - All four numbers are in one component.
Checking all pairs is . Can you do better? Constraints: up to numbers, each up to .