C++ Program To Check Whether Two Strings Are Anagram Of Each Other
Last Updated :
22 Jul, 2022
Write a function to check whether two given strings are anagram of each other or not. An anagram of a string is another string that contains the same characters, only the order of characters can be different. For example, "abcd" and "dabc" are an anagram of each other.
Method 1 (Use Sorting):
- Sort both strings
- Compare the sorted strings
Below is the implementation of the above idea:
C++
// C++ program to check whether two
// strings are anagrams of each other
#include <bits/stdc++.h>
using namespace std;
/* Function to check whether two strings
are anagram of each other */
bool areAnagram(string str1, string str2)
{
// Get lengths of both strings
int n1 = str1.length();
int n2 = str2.length();
// If length of both strings is not
// same, then they cannot be anagram
if (n1 != n2)
return false;
// Sort both the strings
sort(str1.begin(), str1.end());
sort(str2.begin(), str2.end());
// Compare sorted strings
for (int i = 0; i < n1; i++)
if (str1[i] != str2[i])
return false;
return true;
}
// Driver code
int main()
{
string str1 = "test";
string str2 = "ttew";
// Function Call
if (areAnagram(str1, str2))
cout <<
"The two strings are anagram of each other";
else
cout << "The two strings are not anagram of each "
"other";
return 0;
}
Output:
The two strings are not anagram of each other
Time Complexity: O(nLogn)
Auxiliary space: O(1).
Method 2 (Count characters):
This method assumes that the set of possible characters in both strings is small. In the following implementation, it is assumed that the characters are stored using 8 bit and there can be 256 possible characters.
- Create count arrays of size 256 for both strings. Initialize all values in count arrays as 0.
- Iterate through every character of both strings and increment the count of character in the corresponding count arrays.
- Compare count arrays. If both count arrays are same, then return true.
Below is the implementation of the above idea:
C++
// C++ program to check if two strings
// are anagrams of each other
#include <bits/stdc++.h>
using namespace std;
#define NO_OF_CHARS 256
/* Function to check whether two
strings are anagram of each other */
bool areAnagram(char* str1, char* str2)
{
// Create 2 count arrays and initialize
// all values as 0
int count1[NO_OF_CHARS] = {0};
int count2[NO_OF_CHARS] = {0};
int i;
// For each character in input strings,
// increment count in the corresponding
// count array
for (i = 0; str1[i] && str2[i]; i++)
{
count1[str1[i]]++;
count2[str2[i]]++;
}
// If both strings are of different length.
// Removing this condition will make the
// program fail for strings like "aaca"
// and "aca"
if (str1[i] || str2[i])
return false;
// Compare count arrays
for (i = 0; i < NO_OF_CHARS; i++)
if (count1[i] != count2[i])
return false;
return true;
}
// Driver code
int main()
{
char str1[] = "geeksforgeeks";
char str2[] = "forgeeksgeeks";
// Function Call
if (areAnagram(str1, str2))
cout <<
"The two strings are anagram of each other";
else
cout << "The two strings are not anagram of each "
"other";
return 0;
}
// This is code is contributed by rathbhupendra
Output:
The two strings are anagram of each other
Time Complexity: O(n)
Auxiliary space: O(n).
Method 3 (count characters using one array):
The above implementation can be further to use only one count array instead of two. We can increment the value in count array for characters in str1 and decrement for characters in str2. Finally, if all count values are 0, then the two strings are anagram of each other. Thanks to Ace for suggesting this optimization.
C++
// C++ program to check if two strings
// are anagrams of each other
#include <bits/stdc++.h>
using namespace std;
#define NO_OF_CHARS 256
bool areAnagram(char* str1, char* str2)
{
// Create a count array and initialize
// all values as 0
int count[NO_OF_CHARS] = { 0 };
int i;
// For each character in input strings,
// increment count in the corresponding
// count array
for (i = 0; str1[i] && str2[i]; i++)
{
count[str1[i]]++;
count[str2[i]]--;
}
// If both strings are of different length.
// Removing this condition will make the
// program fail for strings like "aaca"
// and "aca"
if (str1[i] || str2[i])
return false;
// See if there is any non-zero value
// in count array
for (i = 0; i < NO_OF_CHARS; i++)
if (count[i])
return false;
return true;
}
// Driver code
int main()
{
char str1[] = "geeksforgeeks";
char str2[] = "forgeeksgeeks";
// Function call
if (areAnagram(str1, str2))
cout <<
"The two strings are anagram of each other";
else
cout << "The two strings are not anagram of each "
"other";
return 0;
}
Output:
The two strings are anagram of each other
Time Complexity: O(n)
Auxiliary space: O(n).
Method 4 (Using unordered_map):
We can optimize the space complexity of the above method by using unordered_map instead of initializing 256 characters array. So in this approach, we will first count the occurrences of each unique character with the help of unordered_map for the first string. Then we will reduce the count of each character while we encounter them in the second string. Finally, if the count of each character in the unordered_map is 0 then it means both strings are anagrams else not.
Below is the code for the above approach.
C++
// C++ program to check if two
// strings are anagrams of each other
#include <bits/stdc++.h>
using namespace std;
bool isAnagram(string a,string b)
{
// Check if both strings has same length or not
if (a.length() != b.length()) {
return false;
}
// Initialising unordered_map
unordered_map<char,int> m;
// Storing the count of each character
// present in first String
for (int i = 0; i < a.length(); i++) {
m[a[i]]++;
}
// Now iterating over second String
for (int i = 0; i < b.length(); i++) {
// Check if unordered_map already contain the current
// character or not
if (m[b[i]]) {
// If contains reduce count of that
// character by 1 to indicate that current
// character has been already counted as
// idea here is to check if in last count of
// all characters in last is zero which
// means all characters in String a are
// present in String b.
m[b[i]] -= 1;
}
}
// Loop over all keys and check if all keys are 0
// as it means that all the characters are present
// in equal count in both strings.
for (auto items : m) {
if (items.second != 0) {
return false;
}
}
// Returning True as all keys are zero
return true;
}
// Driver code
int main()
{
string str1 = "geeksforgeeks";
string str2 = "forgeeksgeeks";
// Function call
if (isAnagram(str1, str2))
cout<<"The two strings are anagram of each other"<<endl;
else
cout<<"The two strings are not anagram of each other"<<endl;
}
// This code is contributed by Pushpesh Raj
OutputThe two strings are anagram of each other
Time Complexity: O(n)
Auxiliary space: O(m) where m is the number of unique characters in the first string.
Please suggest if someone has a better solution which is more efficient in terms of space and time.
Please refer complete article on Check whether two strings are anagram of each other for more details!
Similar Reads
C Program to check if two given strings are isomorphic to each other Given two strings str1 and str2, the task is to check if the two given strings are isomorphic to each other or not. Two strings are said to be isomorphic if there is a one to one mapping possible for every character of str1 to every character of str2 and all occurrences of every character in str1 ma
2 min read
C++ Program to check if strings are rotations of each other or not Given a string s1 and a string s2, write a snippet to say whether s2 is a rotation of s1? (eg given s1 = ABCD and s2 = CDAB, return true, given s1 = ABCD, and s2 = ACBD , return false) Algorithm: areRotations(str1, str2) 1. Create a temp string and store concatenation of str1 to str1 in temp. temp =
2 min read
C++ Program to compare two string using pointers Given two strings, compare the strings using pointers Examples: Input: str1 = geeks, str2 = geeks Output: Both are equal Input: str1 = hello, str2 = hellu Output: Both are not equal As their length are same but characters are different The idea is to dereference given pointers, compare values and ad
1 min read
Number of sub-strings which are anagram of any sub-string of another string Given two strings S1 and S2, the task is to count the number of sub-strings of S1 that are anagrams of any sub-string of S2. Examples: Input: S1 = "ABB", S2 = "BAB" Output: 5 There are 6 sub-strings of S1 : "A", "B", "B", "AB", "BB" and "ABB" Out of which only "BB" is the one which is not an anagram
10 min read
How to Compare Two Substrings in a Character Array in C++? In C++, character arrays are used to store a sequence of characters also known as strings. A Substring is a continuous sequence of characters within a string. In this article, we will learn how we can compare two substrings in a character array in C++. Examples: Input: string: "Hello World" Substrin
2 min read
C++ Program for Check if given string can be formed by two other strings or their permutations Given a string str and an array of strings arr[], the task is to check if the given string can be formed by any of the string pair from the array or their permutations. Examples: Input: str = "amazon", arr[] = {"loa", "azo", "ft", "amn", "lka"} Output: Yes The chosen strings are "amn" and "azo" whic
4 min read
Count of strings that become equal to one of the two strings after one removal Given two strings str1 and str2, the task is to count all the valid strings. An example of a valid string is given below: If str1 = "toy" and str2 = "try". Then S = "tory" is a valid string because when a single character is removed from it i.e. S = "tory" = "try" it becomes equal to str1. This prop
9 min read
Count of anagrams of each string in an array present in another array Given two arrays arr1[] and arr2[] consisting of strings, the task is to print the count of anagrams of every string in arr2[] that are present in arr1[]. Examples: Input: arr1[] = ["geeks", "learn", "for", "egeks", "ealrn"], arr2[] = ["kgees", "rof", "nrael"] Output: 2 1 2 Explanation: Anagrams of
13 min read
C++ Program For Comparing Two Strings Represented As Linked Lists Given two strings, represented as linked lists (every character is a node in a linked list). Write a function compare() that works similar to strcmp(), i.e., it returns 0 if both strings are the same, 1 if the first linked list is lexicographically greater, and -1 if the second string is lexicograph
2 min read
Check if a string is suffix of another Given two strings s1 and s2, check if s1 is a suffix of s2. Or in simple words, we need to find whether string s2 ends with string s1. Examples : Input : s1 = "geeks" and s2 = "geeksforgeeks" Output : Yes Input : s1 = "world", s2 = "my first code is hello world" Output : Yes Input : s1 = "geeks" and
6 min read