# LeetCode 421Maximum XOR of Two Numbers in an Array

## LeetCode 421 Maximum XOR of Two Numbers in an Array Problem

``````class Solution(object):
def findMaximumXOR(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
# https://discuss.leetcode.com/topic/63299/python-6-lines-bit-by-bit
for i in range(32)[::-1]:
# use a set to remove duplicate
prefixes = {num >> i for num in nums}
# if there is x y in prefixes, where x ^ y = answer ^ 1
answer += any(answer ^ 1 ^ p in prefixes for p in prefixes)

if __name__ == '__main__':
s = Solution()
s.findMaximumXOR([3, 10, 5, 25, 2, 8])
``````
Download Maximum XOR of Two Numbers in an Array.py

## List of all Maximum XOR of Two Numbers in an Array problems

Leetcode 421 Maximum XOR of Two Numbers in an Array problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.

Feedback is the most important part of any website.

If you have any query, suggestion or feedback, Please feel free to contact us.