<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.next = [None] * 2

class Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        binary = []
        maxLen = max([len(bin(num)) for num in nums]) - 2
        root = TrieNode()

        def insert(number) :
            rootcopy = root
            for char in number :
                val = int(char)
                if rootcopy.next[val] == None :
                    rootcopy.next[val] = TrieNode()
                rootcopy = rootcopy.next[val]
        
        def maxor(number) :
            ans = 0
            nonlocal root
            rootcopy = root
            for char in number :
                val = int(char)
                notval = 0 if val else 1
                if rootcopy.next[notval] :
                    ans = ans << 1 | 1
                    rootcopy = rootcopy.next[notval]
                    # print("Found", notval, ans)
                else :
                    ans = ans << 1 
                    rootcopy = rootcopy.next[val]
                    # print("Not found",val, ans)
            return ans
    
        paddedbins = []
        for num in nums :
            binary = bin(num)[2:]
            paddedbin = "0"*(maxLen - len(binary)) + binary
            insert(paddedbin)
            paddedbins.append(paddedbin)
        
        # print(paddedbins)
        # print(root.next)
        ans = 0
        for num in paddedbins :
            print(num)
            ans = max(ans, maxor(num))

        return ans
509559