# Two Pointers On A Sorted Array For Pair Counting: Study Guide
Two Pointers On A Sorted Array For Pair Counting shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Move the left pointer up when the sum is too small and the right pointer down when too large.
## 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) after sorting.
## Common mistake
Double-counting duplicates when the problem wants distinct 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.