Program to find the XOR of ASCII values of characters in a string

Given a string str, the task is to find the XOR of ASCII values of characters in the string.

Examples:

Input: str = “Geeks”
Output: 95
ASCII value of G = 71
ASCII value of e = 101
ASCII value of e = 101
ASCII value of k = 107
ASCII value of s = 115
XOR of ASCII values = 71 ^ 101 ^ 101 ^ 107 ^ 115 = 95

Input: str = “GfG”
Output: 102

Approach: The idea is to find out the ASCII value of each character one by one and find the XOR value of these values.



Below is the implementation of the above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to find XOR of ASCII
// value of characters in string
  
#include <bits/stdc++.h>
using namespace std;
  
// Function to find the XOR of ASCII
// value of characters in string
int XorAscii(string str, int len)
{
  
    // store value of first character
    int ans = int(str[0]);
  
    for (int i = 1; i < len; i++) {
  
        // Traverse string to find the XOR
        ans = (ans ^ (int(str[i])));
    }
  
    // Return the XOR
    return ans;
}
  
// Driver code
int main()
{
  
    string str = "geeksforgeeks";
    int len = str.length();
    cout << XorAscii(str, len) << endl;
  
    str = "GfG";
    len = str.length();
    cout << XorAscii(str, len);
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to find XOR of ASCII
// value of characters in String
class GFG{
   
// Function to find the XOR of ASCII
// value of characters in String
static int XorAscii(String str, int len)
{
   
    // store value of first character
    int ans = (str.charAt(0));
   
    for (int i = 1; i < len; i++) {
   
        // Traverse String to find the XOR
        ans = (ans ^ ((str.charAt(i))));
    }
   
    // Return the XOR
    return ans;
}
   
// Driver code
public static void main(String[] args)
{
   
    String str = "geeksforgeeks";
    int len = str.length();
    System.out.print(XorAscii(str, len) +"\n");
   
    str = "GfG";
    len = str.length();
    System.out.print(XorAscii(str, len)); 
}
}
  
// This code is contributed by PrinciRaj1992

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 program to find XOR of ASCII
# value of characters in str1ing
  
# Function to find the XOR of ASCII
# value of characters in str1ing
def XorAscii(str1, len1):
  
    # store value of first character
    ans = ord(str1[0])
  
    for i in range(1,len1):
  
        # Traverse str1ing to find the XOR
        ans = (ans ^ (ord(str1[i])))
  
    # Return the XOR
    return ans
  
# Driver code
str1 = "geeksforgeeks"
len1 = len(str1)
print(XorAscii(str1, len1))
  
str1 = "GfG"
len1 = len(str1)
print(XorAscii(str1, len1))
  
# This code is contributed by mohit kumar 29

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

      
// C# program to find XOR of ASCII
// value of characters in String
using System;
  
class GFG{
    
// Function to find the XOR of ASCII
// value of characters in String
static int XorAscii(String str, int len)
{
    
    // store value of first character
    int ans = (str[0]);
    
    for (int i = 1; i < len; i++) {
    
        // Traverse String to find the XOR
        ans = (ans ^ ((str[i])));
    }
    
    // Return the XOR
    return ans;
}
    
// Driver code
public static void Main(String[] args)
{
    
    String str = "geeksforgeeks";
    int len = str.Length;
    Console.Write(XorAscii(str, len) +"\n");
    
    str = "GfG";
    len = str.Length;
    Console.Write(XorAscii(str, len)); 
}
}
  
// This code is contributed by PrinciRaj1992

chevron_right


Output:

123
102

Time Complexity: O(N), where N is the length of string.

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

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.