Login and get codingAn anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.[1] For example, the word anagram can be rearranged into "naga ram". Or for example, the word binary can be rearranged into "brainy". - sourceIn this Bite you complete the function below receiving two words and return True/False if word2 is an anagram of word1. See the tests for some interesting anagrams. See if you can use a data structure of the standard library?
238 out of 238 users completed this Bite.
Will you be the 239th person to crack this Bite?
Resolution time: ~27 min. (avg. submissions of 5-240 min.)
Our community rates this Bite 2.5 on a 1-10 difficulty scale.
» You can do it! 😌