XOR of every element of an Array with a given number K

Given an array arr and a number K, find the new array formed by performing XOR of the corresponding element from the given array with the given number K.

Examples:

Input: arr[] = { 2, 4, 1, 3, 5 }, K = 5
Output: 7 1 4 6 0
Explanation:
2 XOR 5 = 7
4 XOR 5 = 1
1 XOR 5 = 4
3 XOR 5 = 6
5 XOR 5 = 0

Input: arr[] = { 4, 75, 45, 42 }, K = 2
Output: 6 73 47 40

Approach:



  1. Traverse the given array.
  2. Then calculate the XOR of each element with K.
  3. Then store it as the element at that index in the output array.
  4. Print the updated array.

Below is the implementation of the above approach.

CPP

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to find XOR of every element
// of an array with a given number K
  
#include <bits/stdc++.h>
using namespace std;
  
// Function to construct new array
void constructXORArray(int A[], int n, int K)
{
    int B[n];
  
    // Traverse the array and
    // compute XOR with K
    for (int i = 0; i < n; i++)
        B[i] = A[i] ^ K;
  
    // Print new array
    for (int i = 0; i < n; i++)
        cout << B[i] << " ";
    cout << endl;
}
  
// Driver code
int main()
{
    int A[] = { 2, 4, 1, 3, 5 };
    int K = 5;
    int n = sizeof(A) / sizeof(A[0]);
    constructXORArray(A, n, K);
  
    int B[] = { 4, 75, 45, 42 };
    K = 2;
    n = sizeof(B) / sizeof(B[0]);
    constructXORArray(B, n, K);
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to find XOR of every element
// of an array with a given number K
import java.util.*;
class GFG
{
  
// Function to construct new array
static void constructXORArray(int A[], int n, int K)
{
       
     int[] B = new int[n];
  
    // Traverse the array and
    // compute XOR with K
    for (int i = 0; i < n; i++)
        B[i] = A[i] ^ K;
  
    // Print new array
    for (int i = 0; i < n; i++)
        System.out.print( B[i] +" ");
    System.out.println();
}
  
// Driver code 
public static void main(String args[]) 
    int A[] = { 2, 4, 1, 3, 5 };
    int K = 5;
    int n = A.length;
    constructXORArray(A, n, K);
  
    int B[] = { 4, 75, 45, 42 };
    K = 2;
    n = B.length;
    constructXORArray(B, n, K);
  
}
}
  
// This code is contributed by shivanisinghss2110

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python program to find XOR of every element
# of an array with a given number K
  
# Function to construct new array
def constructXORArray(A, n, K):
  
    B = [0]*n;
  
    # Traverse the array and
    # compute XOR with K
    for i in range(n):
        B[i] = A[i] ^ K;
  
    # Print new array
    for i in range(n):
        print(B[i], end=" ");
    print();
  
  
# Driver code
if __name__ == '__main__':
    A = [ 2, 4, 1, 3, 5 ];
    K = 5;
    n = len(A);
    constructXORArray(A, n, K);
  
    B = [ 4, 75, 45, 42 ];
    K = 2;
    n = len(B);
    constructXORArray(B, n, K);
# This code contributed by sapnasingh4991

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program to find XOR of every element
// of an array with a given number K
using System;
  
class GFG
{
   
// Function to construct new array
static void constructXORArray(int []A, int n, int K)
{
        
     int[] B = new int[n];
   
    // Traverse the array and
    // compute XOR with K
    for (int i = 0; i < n; i++)
        B[i] = A[i] ^ K;
   
    // Print new array
    for (int i = 0; i < n; i++)
        Console.Write( B[i] +" ");
    Console.WriteLine();
}
   
// Driver code 
public static void Main(String []args) 
    int []A = { 2, 4, 1, 3, 5 };
    int K = 5;
    int n = A.Length;
    constructXORArray(A, n, K);
   
    int []B = { 4, 75, 45, 42 };
    K = 2;
    n = B.Length;
    constructXORArray(B, n, K);
}
}
  
// This code is contributed by Rajput-Ji

chevron_right


Output:

7 1 4 6 0 
6 73 47 40

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.




My Personal Notes arrow_drop_up

Recommended Posts:


Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.