# PageRank Power Iteration: Walkthrough
PageRank Power Iteration shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Iterate p <- alpha A^T p + (1-alpha) v on the column-stochastic (or dangling-node-corrected) adjacency so the iterate converges to the dominant eigenvector.
## 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(k m) for k iterations on a graph with m edges; k is typically tens of iterations.
## Common mistake
Leaving dangling nodes as all-zero columns, which leaks rank every iteration and no longer yields a probability vector.
## 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 learn more.