Comment by Sébastien Portebois on "How to check if two string are anagram?"

A few hints (another take to make you think and compare with Mark ’s suggestions. Ideally, try to implement both, that’s the best way to learn!

check if they have the same length. This is a cheap way to quickly return false when there’s no chance they are anagrams
split the strings in a list of characters for each word
sort those lists
walk through the lists side by side (either manually, or zip them, many variations are possible here), as soon as there’s a difference, they are not anagrams.
if you reach the end of the list, they are anagrams

This is a nice exercise to think about because soo many different solutions are possible. Some will be efficient, some will be easier to code, some easier to read and understand. Trying to find different solutions to address this will help you decide which tradeoff is the best for you in this case.

Search Hashnode