Given a number N, the task is to check if the xor value of the frequency of the digits is zero or not.
Examples:
Input: N = 122233 Output: Yes Frequencies of 1, 2 and 3 are 1, 3, 2 respectively. And Xor of 1, 3 and 2 is 0. Input: N = 123 Output: No
Approach: Count the frequency of all the digits and then iterate over all frequency and xor them if the answer is zero then print Yes else No.
Below is the implementation of the above approach:
C++
// C++ implementation of the above approach#include<bits/stdc++.h>using namespace std;bool check(int s){// creating a frequency array int freq[10] = {0},r; while(s != 0) { // Finding the last digit of the number r = s % 10; // Dividing the number by 10 to // eliminate last digit s = int(s / 10); // counting frequency of each digit freq[r] += 1; } int xor__ = 0; // checking if the xor of all frequency is zero or not for (int i=0;i<10;i++) { xor__ = xor__ ^ freq[i]; if(xor__ == 0) return true; else return false; } }// Driver functionint main(){int s = 122233;if(check(s))cout<<"Yes"<<endl;else cout<<"No"<<endl;}// This code is contributed by// Surendra_Gangwar |
Java
// Java implementation of the above approachimport java.io.*;class GFG{static boolean check(int s){// creating a frequency array int[] freq = new int[10]; int r,i; for(i=0;i<10;i++) { freq[i]= 0; } while(s != 0) { // Finding the last digit of the number r = s % 10; // Dividing the number by 10 to // eliminate last digit s = (int)(s / 10); // counting frequency of each digit freq[r] += 1; } int xor__ = 0; // checking if the xor of all frequency is zero or not for ( i=0;i<10;i++) { xor__ = xor__ ^ freq[i]; if(xor__ == 0) return true; else return false; } return true; }// Driver function public static void main(String[] args) { int s = 122233; if(check(s)) System.out.println("Yes\n"); else System.out.println("No\n");}// This code is contributed by// Rajput-Ji} |
Python3
# Python implementation of the above approachdef check(s): # creating a frequency array freq =[0]*10 while(s != 0): # Finding the last digit of the number r = s % 10 # Dividing the number by 10 to # eliminate last digit s = s//10 # counting frequency of each digit freq[r]+= 1 xor = 0 # checking if the xor of all frequency is zero or not for i in range(10): xor = xor ^ freq[i] if(xor == 0): return True else: return Falses = 122233if(check(s)): print("Yes")else: print("No") |
C#
// C# implementation of the above approachusing System;class GFG{ static bool check(int s){ // creating a frequency array int[] freq = new int[10]; int r, i; for(i = 0; i < 10; i++) { freq[i]= 0; } while(s != 0) { // Finding the last digit of the number r = s % 10; // Dividing the number by 10 to // eliminate last digit s = (int)(s / 10); // counting frequency of each digit freq[r] += 1; } int xor__ = 0; // checking if the xor of all frequency is zero or not for ( i = 0; i < 10; i++) { xor__ = xor__ ^ freq[i]; if(xor__ == 0) return true; else return false; } return true; } // Driver code public static void Main() { int s = 122233; if(check(s)) Console.Write("Yes\n"); else Console.Write("No\n"); }}// This code is contributed by Ita_c. |
PHP
<?php// PHP implementation of the above approachfunction check($s){ // creating a frequency array $freq =array_fill(0,10,0); while($s != 0) { // Finding the last digit of the number $r = $s % 10; // Dividing the number by 10 to // eliminate last digit $s = (int)($s/10); // counting frequency of each digit $freq[$r]+= 1; } $xor = 0; // checking if the xor of all frequency is zero or not for($i=0;$i<10;$i++) $xor = $xor ^ $freq[$i]; if($xor == 0) return true; else return false;}// Main Drive$s = 122233;if(check($s)) print("Yes");else print("No");// This code is contributed by mits?> |
Javascript
<script>// Javascript implementation of // the above approachfunction check(s){// creating a frequency array let freq = new Array(10).fill(0), r; while(s != 0) { // Finding the last digit of the number r = s % 10; // Dividing the number by 10 to // eliminate last digit s = parseInt(s / 10); // counting frequency of each digit freq[r] += 1; } let xor__ = 0; // checking if the xor of all // frequency is zero or not for (let i=0;i<10;i++) { xor__ = xor__ ^ freq[i]; if(xor__ == 0) return true; else return false; } }// Driver functionlet s = 122233;if(check(s))document.write("Yes");else document.write("No"); </script> |
Output:
Yes
Time Complexity: O(|s|), Auxiliary Space: O(10)
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
