oh boy, if you think you are the worst just look at mine. i want to cry even. just kind of demoralizing sometimes to know that i am just so bad at coding and logic. my understanding and comprehension is just weak. i just don't know how to make this simple

Nice one here, man! Much better than the bs that i wrote haha

Haha. Glad you enjoyed it and love the feedback <3

No apology necessary. I do that by mistake all the time :)

this solution belongs to cave.on, i was testing it by mistake and submitted it. apologies.

Bro, i do LOVE your solution! Nice usage example of right sided reduce! Allows you not keeping the last occured index of char, this both with keeping the appearance order of object map keys make this code such elegant! Respect <3

Cool kata, but there is critical flaw in edge cases tests, where we asserts that
["aaA", "Aaa", "aaa"] equals [["aaA", "Aaa"], ["aaa"]].
It is wrong, the right answer should be [["aaA", "Aaa", "aaa"]], because anagrams are case insensitive by its nature, referring to related Wikipedia article https://en.wikipedia.org/wiki/Anagram :
"Listen" is valid anagram for "Silent" vice versa, despite that 'l' and 's' letters have different cases in both words.
Same is relevant for these examples as well:
"New York Times" = "monkeys write"
"Church of Scientology" = "rich-chosen goofy cult"
"McDonald's restaurants" = "Uncle Sam's standard rot"
and more on. Please fix that test case!

here's the winner! jesus this is awesome

Check out my solution with O(n) complexity without any sorting!

Want to notice that this solution was transpiled from mine javascript one to this by OpenAI NN. Amazing!