# Global And Local Inversions: Study Guide
Global And Local Inversions shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A local inversion is an adjacent swap; a global inversion is any iA[j]. The arrays that have equal counts are exactly those where |A[i]-i| <= 1 for every i (you never move an element more than one seat).
## 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).
## Common mistake
Counting both kinds explicitly in O(n^2) when n is 1e5, or checking only adjacent 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 best AI tool for coding tests and OAs.