Compare two strings and determine whether they are anagrams of each other.
The key idea is to verify whether two strings contain exactly the same characters with the same frequencies, just arranged differently. A standard solution checks length first, then uses a frequency map or fixed-size character array to count characters and compare counts. If the input is limited to lowercase letters, a 26-element array gives an O(n) time and O(1) space solution.
END
