<p>You are given an array <code>nums</code> consisting of non-negative integers. You are also given a <code>queries</code> array, where <code>queries[i] = [x<sub>i</sub>, m<sub>i</sub>]</code>.</p>

<p>The answer to the <code>i<sup>th</sup></code> query is the maximum bitwise <code>XOR</code> value of <code>x<sub>i</sub></code> and any element of <code>nums</code> that does not exceed <code>m<sub>i</sub></code>. In other words, the answer is <code>max(nums[j] XOR x<sub>i</sub>)</code> for all <code>j</code> such that <code>nums[j] &lt;= m<sub>i</sub></code>. If all elements in <code>nums</code> are larger than <code>m<sub>i</sub></code>, then the answer is <code>-1</code>.</p>

<p>Return <em>an integer array </em><code>answer</code><em> where </em><code>answer.length == queries.length</code><em> and </em><code>answer[i]</code><em> is the answer to the </em><code>i<sup>th</sup></code><em> query.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [0,1,2,3,4], queries = [[3,1],[1,3],[5,6]]
<strong>Output:</strong> [3,3,7]
<strong>Explanation:</strong>
1) 0 and 1 are the only two integers not greater than 1. 0 XOR 3 = 3 and 1 XOR 3 = 2. The larger of the two is 3.
2) 1 XOR 2 = 3.
3) 5 XOR 2 = 7.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [5,2,4,6,6,3], queries = [[12,4],[8,1],[6,3]]
<strong>Output:</strong> [15,-1,5]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length, queries.length &lt;= 10<sup>5</sup></code></li>
	<li><code>queries[i].length == 2</code></li>
	<li><code>0 &lt;= nums[j], x<sub>i</sub>, m<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
</ul>

class TrieNode:

    def __init__(self):
        self.next = [None, None]
    
    def __str__(self):
        return f"TrieNode({self.next[0]}, {self.next[1]})"

class Solution:
    def maximizeXor(self, nums: List[int], queries: List[List[int]]) -> List[int]:
        MAX_DIGITS = 32
        root: TrieNode = TrieNode()
        nums = sorted(set(nums))
        for i, q in enumerate(queries):
            q.append(i)
        queries = sorted(queries, key=lambda x: x[1])
        ret = [-1 for _ in queries]
        # print(nums, queries)

        i = 0
        for q in queries:
            while i < len(nums):
                n = nums[i]
                if n > q[1]:
                    break
                
                node: TrieNode = root
                for k in range(MAX_DIGITS-1, -1, -1):
                    cur_bit = (n >> k) & 1
                    if node.next[cur_bit] == None:
                        node.next[cur_bit] = TrieNode()
                    node = node.next[cur_bit]
                del node
                i += 1

            node: TrieNode = root
            ans: int = 0
            for k in range(MAX_DIGITS-1, -1, -1):
                cur_bit = (q[0] >> k) & 1
                if node.next[1-cur_bit] != None:
                    node = node.next[1-cur_bit]
                    ans = (ans << 1) + 1
                elif node.next[cur_bit] != None:
                    node = node.next[cur_bit]
                    ans = (ans << 1) + 0
                else:
                    ans = -1
                    break
            ret[q[2]] = ans
        
        # print(root)

        return ret
242688