<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 Trie:
    def __init__(self):
        self.children=[None,None]
    def insert(self,num):
        curr=self
        l=[]
        while num:
            l.append(num&1)
            num=num>>1
        for i in range(32-len(l)):
            l.append(0)
        for bit in l[::-1]:
            if curr.children[bit] is None:
                curr.children[bit]=Trie()
            curr=curr.children[bit]
    def find(self,num):
        curr=self
        l=[]
        ans=0
        while num:
            l.append(num&1)
            num=num>>1
        for i in range(32-len(l)):
            l.append(0)
        p=31
        for bit in l[::-1]:
            if curr.children[1-bit] is not None:
                curr=curr.children[1-bit]
                ans+=2**p
            else:
                curr=curr.children[bit]
            p-=1

        return ans
            
class Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        trie=Trie()
        for num in nums:
            trie.insert(num)
        ans=-1
        for num in nums:
            ans=max(ans,trie.find(num))
        return ans
363459