Want to get involved? We're always looking for ideas and content for Weekly Challenges.
SUBMIT YOUR IDEAThis is pretty close to the posted solution, though a little more robust as it strips out punctuation, whitespace, normalizes case while preserving the original word copies. I added a few more interesting test cases to the input data table, including one very lengthy and very clever one due to Cory Calhoun.
Solved!
Just saw the solution and it is easier than I thought. I took another way splitting up the first [word1] into rows via regex and then searching the letters one by one in [word2] replacing each found letter with '' and each not found with '_'. If the result of the replacements is '' it is an anagram, if not, it isn't.
a couple more steps than i had imagined, but got there all the same.
basically, breakdown all of the letters and number them, if any of the letter/number combos don't match from either field, then that means it isn't an anagram.
My solution.