# Number Theoretic Transform Convolution: Practice Notes
Number Theoretic Transform Convolution shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Replace complex roots of unity with a primitive n-th root modulo a NTT-friendly prime so convolution stays exact in modular arithmetic.
## 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) modular operations.
## Common mistake
Picking a modulus whose multiplicative order does not divide n, so no primitive n-th root exists.
## 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 multilingual AI interview assistant.