<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:
    def findMaximumXOR(self, nums: List[int]) -> int:
        # Define the maximum possible bit length
        max_bit_length = len(bin(max(nums))) - 2
        
        # Initialize the answer and the trie
        answer = 0
        trie = {}
        
        # Function to insert number into trie
        def insert(num):
            node = trie
            for bit in bin(num)[2:].zfill(max_bit_length):
                if bit not in node:
                    node[bit] = {}
                node = node[bit]
            node['#'] = num
        
        # Function to find the maximum XOR for a given number
        def find_max_xor(num):
            node = trie
            for bit in bin(num)[2:].zfill(max_bit_length):
                opposite_bit = '1' if bit == '0' else '0'
                if opposite_bit in node:
                    node = node[opposite_bit]
                else:
                    node = node[bit]
            return num ^ node['#']
        
        # Insert numbers into the trie and find maximum XOR
        for num in nums:
            insert(num)
            answer = max(answer, find_max_xor(num))
        
        return answer
546084