<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:
    def __init__(self):
        self.one = None
        self.zero = None
        self.data = -1

class Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        def binary(num):
            lst = []
            while num>0:
                d = num %2
                lst.append(d)
                num = num //2
            return lst
        def addzeros(bin,length):
            l = length - len(bin)
            for i in range(l):
                bin.append(0)
            return bin
        maxx = max(nums)
        bmax = binary(maxx)
        maxlen = len(bmax)

        root = TrieNode()
        def construct(root,binnum,val):
            l = len(binnum)
            for i in range(l-1,-1,-1):
                x = binnum[i]
                if x==0:
                    if root.zero==None:
                        node = TrieNode()
                        root.zero = node
                    root = root.zero
                else:
                    if root.one==None:
                        node = TrieNode()
                        root.one = node
                    root = root.one
            root.data = val

        for num in nums:
            binnum = binary(num)
            binnum = addzeros(binnum,maxlen)
            # Trie
            construct(root,binnum,num)

        root1,root2 = root,root
        ans = [0]
        def find(root1,root2):
            if root1==None or root2==None:
                return True
            if root1.data!=-1 and root2.data!=-1:
                ans[0] = max(ans[0],root1.data ^ root2.data)
                return False
            f1 = find(root1.one,root2.zero)
            f2 = find(root1.zero,root2.one)
            f3 = False
            if f1 or f2:
                f3 = find(root1.zero,root2.zero)
            if f3:
                find(root1.one,root2.one)

        find(root1,root2)
        return ans[0]
        
199096