Two strings are anagrams if they have the same character counts.
If lengths differ, return false. Otherwise count characters in both strings and compare the counts.
Anagrams have identical frequency for every character; comparing frequency maps exactly captures this condition.
Two strings are anagrams if they have the same character counts.
If lengths differ, return false. Otherwise count characters in both strings and compare the counts.
Anagrams have identical frequency for every character; comparing frequency maps exactly captures this condition.