{"post":"

Anagrams are the strings that have the same letters but the letters are in different orders.

For a better understanding look at the following examples below:

eat, tea, ate
\nant, tan
\ngold ring , long grid
\nchairman, chair man

Thus, from the above examples, we can say that

Total Number of letters are same.
String length need not be same.

Logic:

We will use our first observation as the main idea. We take an array of size 26 to keep a count of each letter of the string. For example, count[0] will contain the number of ‘a’ in the string.

Algorithm:

Take two strings as input.
Initialize two arrays (one for each string) of size 26, and initialize them to 0.
Run a loop and traverse the string.
Next, with the ascii code of each character. We will determine its position by subtracting 97 from it.
Increase the count at that index (of count array) by 1.
Perform the same process for the second string.
Next, compare the value at each index of count1[] and count2[].
If they match we can say that the string are anagrams else, they are not.

Code:

#include <iostream>\r\n#include<string>\r\nusing namespace std;\nint isanagram(string str1,string str2)\r\n{\r\nint count1[26] = {0}, count2[26] = {0}, ascii, i = 0;\r\nwhile (str1[i] != '\\0')         //counting all alphabets in string 1\r\n{\r\nascii=str1[i]-97;\t//taking each character's ascii value and feeding it into the count array\r\ncount1[ascii]+=1;\t//taking into assumption that the string is made of lower case chars only.\r\ni++;\r\n}\r\ni = 0;\r\nwhile (str2[i] != '\\0')              //counting all alphabets in string 2\r\n{\r\nascii=str2[i]-97;\r\ncount2[ascii]+=1;\r\ni++;\r\n}\r\nfor (i = 0; i < 26; i++) //comparing the count of chars in both strings\r\n{\r\nif (count1[i] != count2[i])\r\nreturn 0;\r\n}\r\nreturn 1;\r\n}
\nint main()\r\n{
\nstring str1,str2;\r\ncout&lt;&lt;\"Enter string 1\\n\";\r\ngetline(cin,str1);\r\ncout&lt;&lt;\"Enter String 2:\\n\";\r\ngetline(cin,str2);\r\n\r\nif (isanagram(str1, str2)) //calling the anagram checking method\r\n\tprintf(\"The strings are anagrams\\n\");\r\nelse\r\n\tprintf(\"The strings are not anagrams\\n\");\r\nreturn 0;\n
\n}

Output:
\n

Optimistic case:

\r\nEnter string 1anagram\r\nEnter String 2:nag a ram\r\nThe strings are anagrams\r\n

Pessimistic case:

\r\nEnter string 1hello\r\nEnter String 2:world\r\nThe strings are not anagrams\r\n

\n","title":"Program to check if two strings are anagrams","authorDetails":{"name":"Juhi Kamdar","slug":"juhi-kamdar"},"seo":{"title":"Program to check if two strings are anagrams in C++"},"description":"check if two strings are anagrams in C++ using recursion and while loop. In anagram the string has the same letters but in different order. Anagram program with output..","slug":"cpp/examples/program-to-check-strings-as-anagrams-in-cpp/","articleId":"636a83457bb1ce5072622c09","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}