Skip to content

Practice Maximum XOR With an Element From Array

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#1707
LeetCode Problem

Maximum XOR With an Element From Array

Problem Statement

You are given an array nums consisting of non-negative integers. You are also given a queries array, where queries[i] = [xi, mi]. The answer to the ith query is the maximum bitwise XOR value of xi and any element of nums that does not exceed mi. In other words, the answer is max(nums[j] XOR xi) for all j such that nums[j] <= mi. If all elements in nums are larger than mi, then the answer is -1. Return an integer array answer where answer.length == queries.length and answer[i] is the answer to the ith query.

Source: Maximum XOR With an Element From Array on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [0,1,2,3,4], queries = [[3,1],[1,3],[5,6]]
Output
[3,3,7]

# Example 2

Input
nums = [5,2,4,6,6,3], queries = [[12,4],[8,1],[6,3]]
Output
[15,-1,5]

Constraints

1 <= nums.length, queries.length <= 10^5
queries[i].length == 2
0 <= nums[j], xi, mi <= 10^9

Related LeetCode Problems

Practice more problems similar to Maximum XOR With an Element From Array.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.