Leetcode 421. Maximum XOR of Two Numbers in an Array

Given an array of nonnegative integers, find the maximum XOR value of any pair of elements; the core challenge is to exploit bitwise structure (e.g., a binary trie or greedy mask-and-prefix approach) to compute the answer efficiently for up to ~2e5 numbers with 32-bit values.