# Largest Component Size By Common Factor: Practice Notes

Largest Component Size By Common Factor shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Union-Find each number with its prime factors (or sieve factors); the answer is the size of the largest factor-sharing component.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n √A).

## Common mistake

Unioning two numbers only when one divides the other, which misses pairs that merely share a factor.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview helper that uses your resume.