Strings of Anagrams
You are given an array containing multiple single word strings as an argument. Return true if they are all anagrams of each other.
An anagram is a word made by rearranging the letters of a different word, using all the letters exactly once.
Consider upper and lower case characters the same.
- Must return true or false
- Should be able to handle both upper and lowercase letters
solve(["act","cat","tac"]) > true
solve(["act","cat","garden"]) > false
solve(["UPPERCASE", "praepuces"]) > true