yep, but when you create your own solution, with own seing, thats cool! like you creating your own library

Well since we are talking about words/sentences, they can be only so long, so I don't see why performance would play a huge part in this code. At least for the test cases both solutions are almost equal (sorted even being a bit faster).

I had this originally but it fails if the two words are the same as it returns True. It seems that the problem does not count a word as an anagram of iteself, so it would be asking for a False return if the two words were "Shops" and "sHops".

I used a really long winded recursion implementation and I feel so stupid looking at this

I was really struggling with the iterative solution, but this is so cool.

# trolo

I don't think thats the point of codewars lmao

Geat Job bro!

Same

I guess your right! Wouldnt be surprised if this is how the min and max methods are written.

I had the same idea but yours is cleaner. Well done.

very cool solution