What is Anagram Check?

An Anagram Check determines whether two strings contain exactly the same characters with the same frequencies, regardless of their order. For example, "listen" and "silent" are anagrams because they contain the same letters.

Example

• First String: "listen"
• Second String: "silent"
• Sort both strings
• "eilnst" == "eilnst"
• Therefore, both strings are anagrams.

There are multiple approaches to solve this problem. A common method is to sort both strings and compare them. Another efficient approach is to count the frequency of each character using a HashMap and compare the frequency maps.

Algorithm Steps

1. Check if both strings have the same length.
2. Convert both strings to lowercase (optional).
3. Sort both strings alphabetically.
4. Compare the sorted strings.
5. If both are identical, return True; otherwise return False.