# Find XOR Sum Of All Pairs Bitwise AND: Interview Notes
Find XOR Sum Of All Pairs Bitwise AND shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Compute XOR over (arr1[i] AND arr2[j]) for every pair. Because AND and XOR distribute bitwisely, this equals (XOR of arr1) AND (XOR of arr2).
## 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+m).
## Common mistake
Computing every pair explicitly, or using OR in place of AND.
## 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 interview assistant.