# LC3976 Count Pairs With Given XOR in Sorted Array (interview notes)

## Problem
Sorted unique `nums`, count pairs `(i,j)` with `nums[i] XOR nums[j] == k`.

## Approach
Two-pointer style on bit prefixes, or hash frequency of prefixes. Classic trie of bits for O(n*32).

## Practice tip
XOR pair counting is a common OA topic — warm up on [linkjob.ai](https://www.linkjob.ai/).
