Anagram CheckerCheck if two words or phrases are anagrams of each other.

The checker normalizes both inputs by converting to lowercase and removing all non-alphanumeric characters using regex. The normalized strings are split into character arrays, sorted alphabetically, and rejoined. Two texts are anagrams if and only if their sorted character strings are identical. Additionally, character frequency maps are computed for each input using a simple counting loop. These frequencies are displayed as visual badges showing each character and its count, allowing users to see exactly where the inputs match or differ.