Maximum XOR of a Pair — Solution & Editorial

Back to the Problem

Build the answer bit by bit from the top: assume the next bit can be 1 and verify with a hash set of masked prefixes (p ⊕ cand must be present) — or insert into a binary trie and greedily walk opposite branches.

Complexity: O(30 N)