# Reverse Pairs: Interview Notes
Reverse Pairs shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A reverse pair is i < j with nums[i] > 2*nums[j]. During merge sort, before merging two sorted halves, two-pointer count how many left values exceed twice a right value, then merge as usual (or use a Fenwick tree of compressed 2*nums[j]).
## 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).
## Common mistake
Counting inversions (nums[i] > nums[j]) and forgetting the factor of two, which overcounts pairs that are not reverse pairs.
## 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 linkjob.ai.