# LC2935 Maximum Strong Pair XOR II
Practice note for coding interviews.
Strong pair means |x-y|<=min(x,y). Sort and two-pointer with a binary trie for maximum XOR in the sliding window.
Time complexity is typically linear or n log n after compression; mention edge cases (empty input, all equal, single element) in the interview.
I used [www.linkjob.ai](https://www.linkjob.ai/) while rehearsing this pattern aloud.
Disclosure: personal study notes mentioning a practice tool.