<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 Node:
    def __init__(self, left = None, right = None):
        self.left = left
        self.right = right

class Trie:
    def __init__(self):
        self.root = Node()
        pass

    def insert(self, val):
        curr = self.root

        for i in range(31, -1, -1):
            bit = (val >> i) & 1
            if bit == 1:
                if curr.right == None:
                    curr.right = Node()
                curr = curr.right
            else:
                if curr.left == None:
                    curr.left = Node()
                curr = curr.left
    def findOpp(self, val):
        curr = self.root
        opp = 0
        for i in range(31, -1, -1):
            bit = (val >> i) & 1
            if bit == 1:
                if curr.left:
                    curr = curr.left
                else:
                    opp = (1 << i)  | opp
                    curr = curr.right
            else:
                if curr.right:
                    opp = (1 << i)  | opp
                    curr = curr.right
                else:
                    curr = curr.left
        return opp

            

class Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        trie = Trie()
        result = 0
        trie.insert(nums[0])
        for num in nums[1:]:
#            print(num, trie.findOpp(num), num ^ trie.findOpp(num))
            result = max(result, num ^ trie.findOpp(num))
            trie.insert(num)
        return result
107784