Question:

Find out if two stings are anagrams or not with Java

Summary:

Suppose we have two strings A and B with N number of alphabets in it. Using Java, we have to find out whether both strings are anagrams of each other or not.

What is an anagram?

An anagram of a string is another string that contains the same characters, but the order of the characters can be different.

Note:-

If the strings are anagrams, you have to return True, or else return False
|s| represents the length of string s.

Solution:

class Solution

{

//Function is to check whether two strings are anagrams of each other or not.

public static boolean isAnagram(String str1,String str2)

{

// Your code here

if(str1.length() != str2.length()) {

return false;

}

int size = str1.length();

int[] freqStr1 = new int[26];

int[] freqStr2 = new int[26];

for(int i=0; i<size; i++) {

char ch1 = str1.charAt(i);

char ch2 = str2.charAt(i);

freqStr1[ch1 - 'a']+=1;

freqStr2[ch2 - 'a']+=1;

}

for(int i=0; i<26; i++){

if(freqStr1[i] != freqStr2[i]){

return false;

}

return true;

}

Explanation:

Function Signature: The code defines a Java class named Solution with a static method isAnagram that takes two String parameters str1 and str2 and returns a boolean value indicating whether the two strings are anagrams of each other or not.
Input Validation: The method begins by checking if the lengths of str1 and str2 are equal. If they are not equal, it immediately returns false, indicating that the strings cannot be anagrams if their lengths differ.
Frequency Arrays: Two integer arrays freqStr1 and freqStr2 of size 26 are created to store the frequencies of characters in the input strings. These arrays represent the count of each alphabet (a-z) in the respective strings.
Character Frequency Calculation: The code iterates through each character of str1 and str2 using a loop. For each character, it calculates its index in the frequency array by subtracting the ASCII value of 'a' from the character's ASCII value. Then, it increments the corresponding index in the frequency array.
Comparison of Frequencies: After calculating the frequencies of characters in both strings, the code compares the frequency arrays freqStr1 and freqStr2. If any frequency value differs between the two arrays, the method returns false, indicating that the strings are not anagrams. If all frequencies match, the method returns true, indicating that the strings are indeed anagrams of each other.