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[2]{};
};
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[0], limit = q[1];
int ans = 0;
TrieNode* p = root;
for (int i = 30; i >= 0; --i) {
if (x & (1 << i)) {
if (p->children[0]) {
p = p->children[0];
} else if (!p->children[1] || (p->children[1]->lo > limit)) {
ret.emplace_back(-1);
break;
} else {
p = p->children[1];
ans ^= (1 << i);
}
} else {
if (p->children[1] && (p->children[1]->lo <= limit)) {
p = p->children[1];
ans ^= (1 << i);
} else if (!p->children[0]) {
ret.emplace_back(-1);
break;
} else {
p = p->children[0];
}
}
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) {
// set.add(x >> i);
mp.put(x >> i, Math.min(x, mp.getOrDefault(x >> i, Integer.MAX_VALUE)));
}
ls.add(mp);
}
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[0];
int limit = q[1];
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[0]) {
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[0] <= limit else -1 for x, limit in queries]
View More Similar Problems
Compare two linked lists
You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis
View Solution →Merge two sorted linked lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C
View Solution →Get Node Value
This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t
View Solution →Delete duplicate-value nodes from a sorted linked list
This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -
View Solution →Cycle Detection
A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer
View Solution →Find Merge Point of Two Lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share
View Solution →