Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Remove one element to get maximum XOR

  • Difficulty Level : Medium
  • Last Updated : 03 Mar, 2022

Given an array arr[] of N elements, the task is to remove one element from the array such that the XOR value of the array is maximized. Print the maximized value.
Examples: 
 

Input: arr[] = {1, 1, 3} 
Output: 2 
All possible ways of deleting one element and their corresponding XOR values will be: 
a) Remove 1 -> (1 XOR 3) = 2 
b) Remove 1 -> (1 XOR 3) = 2 
c) Remove 3 -> (1 XOR 1) = 0 
Thus, the final answer is 2.
Input: arr[] = {3, 3, 3} 
Output: 0 
 

 

Naive approach: One way will be to remove each element one by one and then finding the XOR of the remaining elements. The time complexity of this approach will be O(N2).
Efficient approach: 
 

  • Find XOR of all the elements of the array. Let’s call this value X.
  • For each element arr[i], perform Y = (X XOR arr[i]) and update the final answer as ans = max(Y, ans).

The above method works because if (A XOR B) = C then (C XOR B) = A. To find XOR(arr[0…i-1]) ^ XOR(arr[i+1…N-1]), all we have to perform is XOR(arr) ^ arr[i] where XOR(arr) is the XOR of all the elements of the array.
Below is the implementation of the above approach: 
 

C++




// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to return the maximized XOR
// after removing an element from the array
int maxXOR(int* arr, int n)
{
    // Find XOR of the complete array
    int xorArr = 0;
    for (int i = 0; i < n; i++)
        xorArr ^= arr[i];
 
    // To store the final answer
    int ans = 0;
 
    // Iterating through the array to find
    // the final answer
    for (int i = 0; i < n; i++)
        ans = max(ans, (xorArr ^ arr[i]));
 
    // Return the final answer
    return ans;
}
 
// Driver code
int main()
{
    int arr[] = { 1, 1, 3 };
    int n = sizeof(arr) / sizeof(int);
 
    cout << maxXOR(arr, n);
 
    return 0;
}
Java



// Java implementation of the approach
class GFG
{
     
    // Function to return the maximized XOR
    // after removing an element from the array
    static int maxXOR(int arr[], int n)
    {
        // Find XOR of the complete array
        int xorArr = 0;
        for (int i = 0; i < n; i++)
            xorArr ^= arr[i];
     
        // To store the final answer
        int ans = 0;
     
        // Iterating through the array to find
        // the final answer
        for (int i = 0; i < n; i++)
            ans = Math.max(ans, (xorArr ^ arr[i]));
     
        // Return the final answer
        return ans;
    }
     
    // Driver code
    public static void main (String[] args)
    {
        int arr[] = { 1, 1, 3 };
        int n = arr.length;
        System.out.println(maxXOR(arr, n));
    }
}
 
// This code is contributed by AnkitRai01
Python3



# Python3 implementation of the approach
 
# Function to return the maximized XOR
# after removing an element from the array
def maxXOR(arr, n):
     
    # Find XOR of the complete array
    xorArr = 0
    for i in range(n):
        xorArr ^= arr[i]
 
    # To store the final answer
    ans = 0
 
    # Iterating through the array to find
    # the final answer
    for i in range(n):
        ans = max(ans, (xorArr ^ arr[i]))
 
    # Return the final answer
    return ans
 
# Driver code
arr = [1, 1, 3]
n = len(arr)
 
print(maxXOR(arr, n))
 
# This code is contributed by Mohit Kumar
C#



// C# implementation of the approach
using System;
 
class GFG
{
     
    // Function to return the maximized XOR
    // after removing an element from the array
    static int maxXOR(int []arr, int n)
    {
        // Find XOR of the complete array
        int xorArr = 0;
        for (int i = 0; i < n; i++)
            xorArr ^= arr[i];
     
        // To store the readonly answer
        int ans = 0;
     
        // Iterating through the array to find
        // the readonly answer
        for (int i = 0; i < n; i++)
            ans = Math.Max(ans, (xorArr ^ arr[i]));
     
        // Return the readonly answer
        return ans;
    }
     
    // Driver code
    public static void Main(String[] args)
    {
        int []arr = { 1, 1, 3 };
        int n = arr.Length;
        Console.WriteLine(maxXOR(arr, n));
    }
}
 
// This code is contributed by 29AjayKumar
Javascript



<script>
// Javascript implementation of the approach
 
// Function to return the maximized XOR
// after removing an element from the array
function maxXOR(arr, n)
{
    // Find XOR of the complete array
    let xorArr = 0;
    for (let i = 0; i < n; i++)
        xorArr ^= arr[i];
 
    // To store the final answer
    let ans = 0;
 
    // Iterating through the array to find
    // the final answer
    for (let i = 0; i < n; i++)
        ans = Math.max(ans, (xorArr ^ arr[i]));
 
    // Return the final answer
    return ans;
}
 
// Driver code
    let arr = [ 1, 1, 3 ];
    let n = arr.length;
 
    document.write(maxXOR(arr, n));
 
</script>
Output: 
2
 
Time Complexity: O(n)
Auxiliary Space: O(1)

My Personal Notes
arrow_drop_up
Previous
Higher-Order Function in Golang
Next

Python | Alternate front - rear Sum
Recommended Articles
Page :
Ways to remove one element from a binary string so that XOR becomes zero
19, Jul 17
Count of subarrays in range [L, R] having XOR + 1 equal to XOR (XOR) 1 for M queries
26, Oct 21
Remove one element to get minimum OR value
23, Dec 19
Maximum XOR value of maximum and second maximum element among all possible subarrays
08, Jan 20
Number of ways to erase exactly one element in the Binary Array to make XOR zero
10, Oct 19
Maximize the minimum element of Array by reducing elements one by one
17, Jan 22
Remaining array element after repeated removal of last element and subtraction of each element from next adjacent element
23, Feb 21
Range Query on array whose each element is XOR of index value and previous element
24, Dec 17
Replace every array element by Bitwise Xor of previous and next element
14, Nov 18
Given a set, find XOR of the XOR's of all subsets.
27, Dec 15
Choose X such that (A xor X) + (B xor X) is minimized
03, May 19
Count of integers K in range [0, N] such that (K XOR K+1) equals (K+2 XOR K+3)
06, Jul 21
Maximize count of pairs whose bitwise XOR is even by replacing such pairs with their Bitwise XOR
22, Feb 21
Bitwise XOR of same indexed array elements after rearranging an array to make XOR of same indexed elements of two arrays equal
05, Aug 21
Find XOR of two number without using XOR operator
21, Oct 15
Maximum possible XOR of every element in an array with another array
04, Oct 17
Queries to calculate maximum Bitwise XOR of X with any array element not exceeding M
23, Mar 21
Maximum element in an array such that its previous and next element product is maximum
02, Jul 19
XOR Linked List: Remove last node of the Linked List
24, Feb 21
XOR linked list- Remove first node of the linked list
18, Jan 21
Number of subarrays such that XOR of one half is equal to the other
18, Feb 19
Maximize the maximum subarray sum after removing atmost one element
16, Apr 19
Maximum possible GCD after replacing at most one element in the given array
27, Nov 19
Maximum number of pairs of distinct array elements possible by including each element in only one pair
03, Aug 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
DivyanshuShekhar1
@DivyanshuShekhar1
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!