Two strings, and , are called anagrams if they contain all the same characters in the same frequencies. for example, the anagrams of cat are cat, act, tac, tca, atc, and cta. complete the function in the editor. if and are case-insensitive anagrams, print "anagrams"; otherwise, print "not anagrams" instead.

static boolean isAnagram(String a, String b) {

// 1 - Strings inequal in length can never be Anagram

        if (a.length() != b.length()) {

             return false;

        }

       // 2 - Convert both Strings to Lower Case

       a = a.toLowerCase();

        b = b.toLowerCase();

       // 3 - Create an Array to store character count

        int charCount[] = new int[26];

 // 4 - Count Each Character

        for (int i = 0; i < a.length(); i++) {

             charCount[a.charAt(i) - 97]++;

             charCount[b.charAt(i) - 97]--;

        }

        // 5 - Check  for mismatching characters

        for (int i = 0; i < charCount.length; i++) {

             if (charCount[i] != 0) {

                 return false;

            }

        }

       return true;

}

Explanation:

Complete Questions:

Two strings, a and b, are called anagrams if they contain all the same characters in the same frequencies. For example, the anagrams of CAT are CAT, ACT, TAC, TCA, ATC, and CTA. Complete the function in the editor. If and are case-insensitive anagrams, print "Anagrams"; otherwise, print "Not Anagrams" instead.

Function:

static boolean isAnagram(String a, String b) {

       // Complete the function

}

This algorithm has five steps to calculate whether two given strings are anagram or not.

brought all tribes under one rule, created first mongol written language, legal code, strong conquest