1829. Maximum XOR for Each Query
UnknownView on LeetCode
Time: O(n)
Space: O(n)
Problem Overview
Maximum XOR for Each Query (Unknown) asks you to solve a structured algorithmic task. This is a common Array / Bit Manipulation pattern in coding interviews. Build XOR prefix; for each query XOR prefix with (2^maximumBit - 1) to flip all bits.
A full step-by-step explanation is being added. See the study guide for pattern-based practice.
Approach
Build XOR prefix; for each query XOR prefix with (2^maximumBit - 1) to flip all bits.
Related patterns: Array, Bit Manipulation, Prefix Sum
1829.cs
C#
// Approach: Build XOR prefix; for each query XOR prefix with (2^maximumBit - 1) to flip all bits.
// Time: O(n) Space: O(n)
public class Solution
{
public int[] GetMaximumXor(int[] nums, int maximumBit)
{
int n = nums.Length;
int mx = (1 << maximumBit) - 1;
int[] ans = new int[n];
int xors = 0;
for (int i = 0; i < n; ++i)
{
xors ^= nums[i];
ans[n - 1 - i] = xors ^ mx;
}
return ans;
}
}Was this solution helpful?
Related Problems
- 4. Median of Two Sorted Arrays(Hard)
- 11. Container With Most Water(Medium)
- 15. 3Sum(Medium)
- 16. 3Sum Closest(Medium)
- 26. Remove Duplicates from Sorted Array(Easy)
- 27. Remove Element(Easy)