<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) -> None:
        self.left = None
        self.right = None


class BinaryTrie:
    def __init__(self) -> None:
        self.root = TrieNode()

    def insert(self, num: int, bit_order: int) -> None:
        curr = self.root

        while bit_order >= 0:
            bit = (num >> bit_order) & 1

            if bit == 0:
                if curr.left is None:
                    curr.left = TrieNode()

                curr = curr.left
            else:
                if curr.right is None:
                    curr.right = TrieNode()

                curr = curr.right

            bit_order -= 1


class Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        max_num = max(nums)
        max_bit_order = 0

        while max_num:
            max_bit_order += 1
            max_num >>= 1

        max_bit_order -= 1

        trie = BinaryTrie()
        for num in nums:
            trie.insert(num, max_bit_order)

        max_xor = 0
        for num in nums:
            curr = trie.root
            xor = 0
            bit_order = max_bit_order

            while bit_order >= 0:
                bit = (num >> bit_order) & 1

                if bit == 0:
                    if curr.right:
                        xor |= 1 << bit_order
                        curr = curr.right
                    else:
                        curr = curr.left
                else:
                    if curr.left:
                        xor |= 1 << bit_order
                        curr = curr.left
                    else:
                        curr = curr.right

                bit_order -= 1

            max_xor = max(max_xor, xor)

        return max_xor

162571