# Sieve Of Eratosthenes With Smallest Prime Factor: Walkthrough

Sieve Of Eratosthenes With Smallest Prime Factor shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Store the smallest prime factor of every number to factor any value up to n in O(log n).

## 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 log log n) build.

## Common mistake

Starting the inner loop at 2p instead of p*p, which is just slower, or at p, which marks the prime itself.

## 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 Linkjob AI.