<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]

class Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        def addToTrie(s):
            nonlocal root
            if(not root):
                root = Trie()
                curr = root

            curr = root.children
            for i in range(32):
                if(s[i] == "0"):
                    if(not curr[0]):
                        curr[0] = Trie()
                    curr = curr[0]
                elif(s[i] == "1"):
                    if(not curr[1]):
                        curr[1] = Trie()
                    curr = curr[1]
                curr = curr.children


        def findMaxMatch(elem):
            curr = root
            total = 0
            for i in range(32):
                curr = curr.children
                if(elem[i] == "0"):
                    if(curr[1]):
                        total += 2**(32-i-1)
                        curr = curr[1]
                    else:
                        curr = curr[0]
                elif(elem[i] == "1"):
                    if(curr[0]):
                        total += 2**(32-i-1)
                        curr = curr[0]
                    else:
                        curr = curr[1]
            return total



        root = None
        for i in nums:
            binRepr = str(bin(i)[2:])
            paddedRepr = (32-len(binRepr))*"0" + binRepr
            addToTrie(paddedRepr)
        
        
        maxi = -float("inf")
        for j in nums:
            binR = str(bin(j)[2:])
            paddedR = (32-len(binR))*"0" + binR
            maxi = max(maxi,findMaxMatch(paddedR))
        return maxi




        

        
445640