<p>Given an integer array <code>nums</code>, return <em>the maximum result of </em><code>nums[i] XOR nums[j]</code>, where <code>0 &lt;= i &lt;= j &lt; n</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,10,5,25,2,8]
<strong>Output:</strong> 28
<strong>Explanation:</strong> The maximum result is 5 XOR 25 = 28.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [14,70,53,83,49,91,36,80,92,51,66,70]
<strong>Output:</strong> 127
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 10<sup>5</sup></code></li>
	<li><code>0 &lt;= nums[i] &lt;= 2<sup>31</sup> - 1</code></li>
</ul>

class TrieNode:
    zero = None
    one = None
    value = None

class Solution:
    def findMaximumXOR(self, nums):
        root = TrieNode()
        bit_range = range(31, -1, -1)
        
        for num in nums:
            curr = root
            for i in bit_range:
                mask = 1 << i
                masked_num = num & mask
                if masked_num == 0:
                    if not curr.zero:
                        curr.zero = TrieNode()
                    curr = curr.zero
                else:
                    if not curr.one:
                        curr.one = TrieNode()
                    curr = curr.one
            curr.value = num
        # print(curr.value)
        max_xor = 0
        for num in nums:
            curr = root
            # print("curr",root)
            for i in bit_range:
                mask = 1 << i
                masked_num = num & mask
                if masked_num == 0:
                    if curr.one:
                        curr = curr.one
                    else:
                        curr = curr.zero
                else:
                    if curr.zero:
                        curr = curr.zero
                    else:
                        curr = curr.one
            # print(num,curr.value)
            max_xor_for_num = num ^ curr.value
            if max_xor_for_num > max_xor:
                max_xor = max_xor_for_num

        return max_xor


180834