Anagram Check
Either sort both strings and compare them, or build character frequency maps. The hash-map version is linear time and communicates counting skill well.
Check whether two strings contain the same characters with the same counts.
Either sort both strings and compare them, or build character frequency maps. The hash-map version is linear time and communicates counting skill well.
Either sort both strings and compare them, or build character frequency maps. The hash-map version is linear time and communicates counting skill well.
Check whether two strings contain the same characters with the same counts.