Challenge #59: Is it an Anagram?

[fluteman]

I made this harder by employing a formatting macro.

Its a case of splitting up a word into letters and rows and then sorting the letters by word. From there you get a Word-LetterID and join this with the second list of words. Count the matches, this should equal the word1 length.

[robert-headington]

#59

[BransonJamesFarley]

Spoiler

 

[martinson]

🗿

[myastarling]

This was a fun challenge! Here's my solution