# Sum Of Floored Pairs: Study Guide
Sum Of Floored Pairs shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Count frequencies, build a prefix of counts, and for each unique value x add count[x] * sum over multiples t*x of (how many nums fall in t*x, (t+1)*x)) * t, modulo 1e9+7.
## 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(max(A) log max(A)).
## Common mistake
Comparing every pair in O(n^2).
## 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 interview copilot.