Premium Only Content

1829. Maximum XOR for Each Query
You are given a sorted array nums of n non-negative integers and an integer maximumBit. You want to perform the following query n times:
Find a non-negative integer k < 2maximumBit such that nums[0] XOR nums[1] XOR ... XOR nums[nums.length-1] XOR k is maximized. k is the answer to the ith query.
Remove the last element from the current array nums.
Return an array answer, where answer[i] is the answer to the ith query.
Example 1:
Input: nums = [0,1,1,3], maximumBit = 2
Output: [0,3,2,3]
Explanation: The queries are answered as follows:
1st query: nums = [0,1,1,3], k = 0 since 0 XOR 1 XOR 1 XOR 3 XOR 0 = 3.
2nd query: nums = [0,1,1], k = 3 since 0 XOR 1 XOR 1 XOR 3 = 3.
3rd query: nums = [0,1], k = 2 since 0 XOR 1 XOR 2 = 3.
4th query: nums = [0], k = 3 since 0 XOR 3 = 3.
Example 2:
Input: nums = [2,3,4,7], maximumBit = 3
Output: [5,2,6,5]
Explanation: The queries are answered as follows:
1st query: nums = [2,3,4,7], k = 5 since 2 XOR 3 XOR 4 XOR 7 XOR 5 = 7.
2nd query: nums = [2,3,4], k = 2 since 2 XOR 3 XOR 4 XOR 2 = 7.
3rd query: nums = [2,3], k = 6 since 2 XOR 3 XOR 6 = 7.
4th query: nums = [2], k = 5 since 2 XOR 5 = 7.
Example 3:
Input: nums = [0,1,2,2,5,7], maximumBit = 3
Output: [4,3,6,4,6,7]
Constraints:
nums.length == n
1 <= n <= 105
1 <= maximumBit <= 20
0 <= nums[i] < 2maximumBit
nums​​​ is sorted in ascending order.
class Solution {
public:
vector<int> getMaximumXor(vector<int>& nums, int maximumBit) {
int n = nums.size();
vector<int> prefixXOR(n);
prefixXOR[0] = nums[0];
for (int i = 1; i < n; i++) {
prefixXOR[i] = prefixXOR[i - 1] ^ nums[i];
}
vector<int> ans(n);
int mask = (1 << maximumBit) - 1;
for (int i = 0; i < n; i++) {
// find k to maximize value
int currentXOR = prefixXOR[n - 1 - i];
ans[i] = currentXOR ^ mask;
}
return ans;
}
};
-
LIVE
Dr Disrespect
3 hours ago🔴LIVE - DR DISRESPECT - TARKOV ALL DAY
2,578 watching -
LIVE
RiftTV/Slightly Offensive
1 hour agoFREE SPEECH VICTORY, Anti-American Bill DEAD ON ARRIVAL | The Rift Report
1,065 watching -
LIVE
Jeff Ahern
1 hour agoMonday Madness with Jeff Ahern
123 watching -
29:06
Scary Mysteries
3 hours agoKansas’ Most TERRIFYING Crimes Ever
3.96K -
1:42:36
Russell Brand
3 hours agoYOU WERE WARNED! – MAGA Divided As Hegseth THREATENS WAR With Iran – SF577
135K64 -
1:20:08
Sean Unpaved
3 hours agoMichigan Missteps, NBA Vets, and Game 7 Hockey Glory
36.4K -
26:52
The White House
3 hours agoPresident Trump Delivers a Sports Announcement
23.2K19 -
31:52
CryptoWendyO
2 hours ago $0.83 earnedTrump’s HUGE Bitcoin Announcement! US is BUYING Bitcoin
22.7K8 -
1:03:17
Timcast
3 hours agoDemocrats IMPLODING, AOC HECKLED As Infighting Erupts Over Party FAILING
171K111 -
1:57:59
Steven Crowder
6 hours agoEverything Wrong with Meet the Press' Trump Sandbag Interview
406K253