# Linear Sieve Smallest Prime Factor: Explained
Linear Sieve Smallest Prime Factor shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
For each number i, mark i·p as composite using primes p ≤ spf[i], which visits each composite once and records its smallest prime factor.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Continuing past p > spf[i], which restamps composites and loses linearity.
## 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 www.linkjob.ai.