# Maximum XOR Queries - Google Top Interview Questions

### Problem Statement :

```You are given a list of non-negative integers nums and a two-dimensional list of integers queries where each element contains [x, limit].

Return a list such that for each query [x, limit], we find an e in nums such that e ≤ limit and XOR(e, x) is maximized. If there's no such e, use -1.

Constraints

n ≤ 100,000 where n is the length of nums

m ≤ 100,000 where m is the length of queries

Example 1

Input

nums = [2, 4, 8]

queries = [

[3, 5],

[2, 0]

]

Output

[4, -1]

Explanation

For the first query, we can use 2 or 4 in nums. 2 ^ 3 = 1 while 4 ^ 3 = 7 so we pick 4 which yields the

bigger XOR. In the second query, there's no number that's less than or equal to 0, so we set it to -1.```

### Solution :

```                        ```Solution in C++ :

struct TrieNode {
int lo = INT_MAX;
TrieNode* children{};
};

class Solution {
public:
vector<int> solve(vector<int>& nums, vector<vector<int>>& queries) {
TrieNode* root = new TrieNode();
for (int num : nums) {
TrieNode* p = root;
for (int i = 30; i >= 0; --i) {
int nxt = (num & (1 << i)) ? 1 : 0;
if (!p->children[nxt]) p->children[nxt] = new TrieNode();
p = p->children[nxt];
p->lo = min(p->lo, num);
}
}
vector<int> ret;
for (auto q : queries) {
int x = q, limit = q;
int ans = 0;
TrieNode* p = root;
for (int i = 30; i >= 0; --i) {
if (x & (1 << i)) {
if (p->children) {
p = p->children;
} else if (!p->children || (p->children->lo > limit)) {
ret.emplace_back(-1);
break;
} else {
p = p->children;
ans ^= (1 << i);
}
} else {
if (p->children && (p->children->lo <= limit)) {
p = p->children;
ans ^= (1 << i);
} else if (!p->children) {
ret.emplace_back(-1);
break;
} else {
p = p->children;
}
}
if (i == 0) ret.emplace_back(ans);
}
}
return ret;
}
};

vector<int> solve(vector<int>& nums, vector<vector<int>>& queries) {
return (new Solution())->solve(nums, queries);
}```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
public int[] solve(int[] nums, int[][] qs) {
int n = nums.length;
List<Map<Integer, Integer>> ls = new ArrayList<>();
for (int i = 0; i < 32; i++) {
Map<Integer, Integer> mp = new HashMap<>();
for (int x : nums) {
mp.put(x >> i, Math.min(x, mp.getOrDefault(x >> i, Integer.MAX_VALUE)));
}
}
Arrays.sort(nums);

int[] res = new int[qs.length];
Arrays.fill(res, -1);
if (n == 0)
return res;
int cnt = 0;
for (int[] q : qs) {
int v = q;
int limit = q;
int ans = 0;
boolean find = false;
for (int i = 31; i >= 0; i--) {
Set<Integer> ts = ls.get(i).keySet();
Map<Integer, Integer> mp = ls.get(i);
// if(i == 0)System.out.println(ts);
if ((v | (1 << i)) == v) { // this is one
int tk = ans >> i;
if (!ts.contains(tk)) {
ans |= 1 << i;
}

// System.out.println(tk+" "+i+" "+ts+" "+ans);
} else { // we want to get index to be 1
int now = ans | (1 << i);
int tk = now >> i;
/// if we need this index but no that index
if (ts.contains(tk) && mp.get(tk) <= limit) {
ans = now;
}

// System.out.println(tk+" "+i+" "+ts+" "+ans);
}
}
if (ans <= limit && ans >= nums) {
res[cnt] = ans;
}
cnt++;
}
return res;
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, nums, queries):
nums.sort()

def query(x, limit):
start = 0
stop = bisect_right(nums, limit)
num = 0
for i in range(31, -1, -1):
i_th_bit = 1 << i
plus = num + i_th_bit
if nums[start] >= plus:
num = plus
elif nums[stop - 1] >= plus:
cut = bisect_left(nums, plus, start, stop)
if x & i_th_bit:
stop = cut
else:
start = cut
num = plus

return num

return [query(x, limit) if nums and nums <= limit else -1 for x, limit in queries]```
```

## Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

## Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

## Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

## Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

## Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

## Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from