<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 Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        class TrieNode:
            def __init__(self):
                self.left = self.right = None
        
        def insert(root: TrieNode, num: int) -> None:
            curr = root
            for i in range(31, -1, -1):
                if num & (1 << i):
                    if not curr.right:
                        curr.right = TrieNode()
                    curr = curr.right
                else:
                    if not curr.left:
                        curr.left = TrieNode()
                    curr = curr.left
        
        def findMaxXorPair(root: TrieNode, nums: List[int]) -> int:
            max_xor = 0
            for num in nums:
                curr = root
                curr_xor = 0
                for i in range(31, -1, -1):
                    if num & (1 << i):
                        if curr.left is None:
                            curr = curr.right
                        else:
                            curr = curr.left
                            curr_xor += (1 << i)
                    else:
                        if curr.right is None:
                            curr = curr.left
                        else:
                            curr = curr.right
                            curr_xor += (1 << i)
                max_xor = max(max_xor, curr_xor)
            return max_xor
        
        root = TrieNode()
        for num in nums:
            insert(root, num)
        
        return findMaxXorPair(root, nums)

144309