<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(object):
    def findMaximumXOR(self, nums):
        
        trie = {}
                
        def update_trie(x):
            
            cur = trie
            for bit in format(x, '032b'):
                
                if bit not in cur:
                    cur[bit] = {}
                cur = cur[bit]
                
            cur['value'] = x
            
            return

             
        def best_match(x):

            cur = trie
            for bit in format(x, '032b'):
                
                rev = '0' if bit == '1' else '1'
                if rev in cur:
                    cur = cur[rev]
                else:
                    cur = cur[bit]
                    
            return cur['value']
                
        for x in nums:
            update_trie(x)
        
        max_xor = 0
        for x in nums:
            
            max_xor = max( max_xor, x ^ best_match(x) )
         
        return max_xor
546084