# Schonhage Strassen Multiply: Walkthrough
Schonhage Strassen Multiply shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Multiply integers by an FFT over a ring of Fermat numbers (or a similar 2^n + 1 ring) so convolution of digits becomes almost linear.
## 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 n log log n) bit operations.
## Common mistake
Picking a transform length that does not exceed twice the number of digits, which wraps the convolution and corrupts high coefficients.
## 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 https://linkjob.ai.