Leetcode 421. Maximum XOR of Two Numbers in an Array (bit manipulation)
421. Maximum XOR of Two Numbers in an Array
The idea is to check from the highest bit to lowest bit, and we'll find the bit one by one to combine the final result. Here by using mask and set making it possible in O(n*k) time complexicity. The set part used 2 sum idea.