# Pollard Rho Integer Factorization: Study Guide
Pollard Rho Integer Factorization shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Iterate a polynomial modulo n and use Floyd or Brent cycle detection plus gcd(|x-y|, n) to extract a nontrivial 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
Expected n^{1/4} class time per factor for semiprimes.
## Common mistake
Using a polynomial with a bad starting value and never switching after repeated trivial gcds.
## 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 coding interview assistant.