Given two strings,
true if they are anagrams of each other or
false if not. Words are anagrams if they contain the same letters, in any order.
areAnagrams( "listen", "silent" ) => true areAnagrams( "catered", "created" ) => true areAnagrams( "hello", "bob" ) => false areAnagrams( "", "howdy" ) => false
Note: You may assume that
sTwo contain only lower case letters. There will be no numbers, spaces, or any punctuation.
Login / Register
To try your hand at solving this problem you'll need an account on CompSci.Rocks. Please either login or register to continue.
Once you've logged in you'll be able to enter code directly into this page to solve the problem.