Related Articles

# Check if two Integer are anagrams of each other

• Last Updated : 14 Sep, 2021

Given two integers A and B, the task is to check whether the given numbers are anagrams of each other or not. Just like strings, a number is said to be an anagram of some other number if it can be made equal to the other number by just shuffling the digits in it.
Examples:

Input: A = 204, B = 240
Output: Yes

Input: A = 23, B = 959
Output: No

Approach: Create two arrays freqA[] and freqB[] where freqA[i] and freqB[i] will store the frequency of digit i in a and b respectively. Now traverse the frequency arrays and for any digit i if freqA[i] != freqB[i] then the numbers are not anagrams of each other else they are.
Below is the implementation of the above approach:

## C++

 `// C++ implementation of the approach``#include ``using` `namespace` `std;` `const` `int` `TEN = 10;` `// Function to update the frequency array``// such that freq[i] stores the``// frequency of digit i in n``void` `updateFreq(``int` `n, ``int` `freq[])``{` `    ``// While there are digits``    ``// left to process``    ``while` `(n) {``        ``int` `digit = n % TEN;` `        ``// Update the frequency of``        ``// the current digit``        ``freq[digit]++;` `        ``// Remove the last digit``        ``n /= TEN;``    ``}``}` `// Function that returns true if a and b``// are anagarams of each other``bool` `areAnagrams(``int` `a, ``int` `b)``{` `    ``// To store the frequencies of``    ``// the digits in a and b``    ``int` `freqA[TEN] = { 0 };``    ``int` `freqB[TEN] = { 0 };` `    ``// Update the frequency of``    ``// the digits in a``    ``updateFreq(a, freqA);` `    ``// Update the frequency of``    ``// the digits in b``    ``updateFreq(b, freqB);` `    ``// Match the frequencies of``    ``// the common digits``    ``for` `(``int` `i = 0; i < TEN; i++) {` `        ``// If frequency differs for any digit``        ``// then the numbers are not``        ``// anagrams of each other``        ``if` `(freqA[i] != freqB[i])``            ``return` `false``;``    ``}` `    ``return` `true``;``}` `// Driver code``int` `main()``{``    ``int` `a = 240, b = 204;` `    ``if` `(areAnagrams(a, b))``        ``cout << ``"Yes"``;``    ``else``        ``cout << ``"No"``;` `    ``return` `0;``}`

## Java

 `// Java implementation of the approach``class` `GFG``{``    ``static` `final` `int` `TEN = ``10``;``    ` `    ``// Function to update the frequency array``    ``// such that freq[i] stores the``    ``// frequency of digit i in n``    ``static` `void` `updateFreq(``int` `n, ``int` `[] freq)``    ``{``    ` `        ``// While there are digits``        ``// left to process``        ``while` `(n > ``0``)``        ``{``            ``int` `digit = n % TEN;``    ` `            ``// Update the frequency of``            ``// the current digit``            ``freq[digit]++;``    ` `            ``// Remove the last digit``            ``n /= TEN;``        ``}``    ``}``    ` `    ``// Function that returns true if a and b``    ``// are anagarams of each other``    ``static` `boolean` `areAnagrams(``int` `a, ``int` `b)``    ``{``    ` `        ``// To store the frequencies of``        ``// the digits in a and b``        ``int` `[] freqA = ``new` `int``[TEN];``        ``int` `[] freqB = ``new` `int``[TEN];``    ` `        ``// Update the frequency of``        ``// the digits in a``        ``updateFreq(a, freqA);``    ` `        ``// Update the frequency of``        ``// the digits in b``        ``updateFreq(b, freqB);``    ` `        ``// Match the frequencies of``        ``// the common digits``        ``for` `(``int` `i = ``0``; i < TEN; i++)``        ``{``    ` `            ``// If frequency differs for any digit``            ``// then the numbers are not``            ``// anagrams of each other``            ``if` `(freqA[i] != freqB[i])``                ``return` `false``;``        ``}``        ``return` `true``;``    ``}``    ` `    ``// Driver code``    ``public` `static` `void` `main (String[] args)``    ``{``        ``int` `a = ``204``, b = ``240``;``    ` `        ``if` `(areAnagrams(a, b))``            ``System.out.println(``"Yes"``);``        ``else``            ``System.out.println(``"No"``);``    ``}``}` `// This code is contributed by ihirtik``       `

## Python3

 `# Python3 implementation of the approach``TEN ``=` `10` `# Function to update the frequency array``# such that freq[i] stores the``# frequency of digit i in n``def` `updateFreq(n, freq) :` `    ``# While there are digits``    ``# left to process``    ``while` `(n) :``        ``digit ``=` `n ``%` `TEN` `        ``# Update the frequency of``        ``# the current digit``        ``freq[digit] ``+``=` `1` `        ``# Remove the last digit``        ``n ``/``/``=` `TEN` `# Function that returns true if a and b``# are anagarams of each other``def` `areAnagrams(a, b):` `    ``# To store the frequencies of``    ``# the digits in a and b``    ``freqA ``=` `[ ``0` `] ``*` `TEN``    ``freqB ``=` `[ ``0` `] ``*` `TEN` `    ``# Update the frequency of``    ``# the digits in a``    ``updateFreq(a, freqA)` `    ``# Update the frequency of``    ``# the digits in b``    ``updateFreq(b, freqB)` `    ``# Match the frequencies of``    ``# the common digits``    ``for` `i ``in` `range``(TEN):` `        ``# If frequency differs for any digit``        ``# then the numbers are not``        ``# anagrams of each other``        ``if` `(freqA[i] !``=` `freqB[i]):``            ``return` `False``            ` `    ``return` `True` `# Driver code``a ``=` `240``b ``=` `204` `if` `(areAnagrams(a, b)):``    ``print``(``"Yes"``)``else``:``    ``print``(``"No"``)` `# This code is contributed by``# divyamohan123`

## C#

 `// C# implementation of the approach``using` `System;` `class` `GFG``{``    ``static` `int` `TEN = 10;``    ` `    ``// Function to update the frequency array``    ``// such that freq[i] stores the``    ``// frequency of digit i in n``    ``static` `void` `updateFreq(``int` `n, ``int` `[] freq)``    ``{``    ` `        ``// While there are digits``        ``// left to process``        ``while` `(n > 0)``        ``{``            ``int` `digit = n % TEN;``    ` `            ``// Update the frequency of``            ``// the current digit``            ``freq[digit]++;``    ` `            ``// Remove the last digit``            ``n /= TEN;``        ``}``    ``}``    ` `    ``// Function that returns true if a and b``    ``// are anagarams of each other``    ``static` `bool` `areAnagrams(``int` `a, ``int` `b)``    ``{``    ` `        ``// To store the frequencies of``        ``// the digits in a and b``        ``int` `[] freqA = ``new` `int``[TEN];``        ``int` `[] freqB = ``new` `int``[TEN];;``    ` `        ``// Update the frequency of``        ``// the digits in a``        ``updateFreq(a, freqA);``    ` `        ``// Update the frequency of``        ``// the digits in b``        ``updateFreq(b, freqB);``    ` `        ``// Match the frequencies of``        ``// the common digits``        ``for` `(``int` `i = 0; i < TEN; i++)``        ``{``    ` `            ``// If frequency differs for any digit``            ``// then the numbers are not``            ``// anagrams of each other``            ``if` `(freqA[i] != freqB[i])``                ``return` `false``;``        ``}``        ``return` `true``;``    ``}``    ` `    ``// Driver code``    ``public` `static` `void` `Main ()``    ``{``        ``int` `a = 204, b = 240;``    ` `        ``if` `(areAnagrams(a, b))``            ``Console.WriteLine(``"Yes"``);``        ``else``            ``Console.WriteLine(``"No"``);``    ``}``}` `// This code is contributed by ihirtik`

## Javascript

 ``
Output:

`Yes`

#### Method #2 :Using sorting():

• Convert two integers to string.
• Sort the strings and check if they are equal.
• Print Yes if they are equal.
• Else no.

Below is the implementation:

## C++

 `// C++ implementation of the approach``#include ``using` `namespace` `std;` `// Function that returns true if a and b``// are anagarams of each other``bool` `areAnagrams(``int` `a, ``int` `b)``{``  ` `    ``// Converting numbers to strings``    ``string c = to_string(a);``    ``string d = to_string(b);` `    ``// Checking if the sorting values``    ``// of two strings are equal``    ``sort(c.begin(), c.end());``    ``sort(d.begin(), d.end());``    ``if` `(c == d)``        ``return` `true``;``    ``else``        ``return` `false``;``}` `// Driver code``int` `main()``{``    ``int` `a = 240;``    ``int` `b = 204;` `    ``if` `(areAnagrams(a, b))``        ``cout << ``"Yes"``;``    ``else``        ``cout << ``"No"``;``}` `// This code is contributed by ukasp.`

## Python3

 `# Python3 implementation of the approach``# Function that returns true if a and b``# are anagarams of each other``def` `areAnagrams(a, b):``  ` `    ``# Converting numbers to strings``    ``a ``=` `str``(a)``    ``b ``=` `str``(b)``    ` `    ``# Checking if the sorting values``    ``# of two strings are equal``    ``if``(``sorted``(a) ``=``=` `sorted``(b)):``        ``return` `True``    ``else``:``        ``return` `False`  `# Driver code``a ``=` `240``b ``=` `204` `if` `(areAnagrams(a, b)):``    ``print``(``"Yes"``)``else``:``    ``print``(``"No"``)` `# This code is contributed by vikkycirus`

Output:

`Yes`

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

My Personal Notes arrow_drop_up