It's neat, but also highly inefficient.

You hit the 5%.

Read the description carefully.

O enunciado pede que a palavra seja dividida individualmente em cada caractere e o espaço dentro do split garante que isso aconteça.

I don't know. Hopefully the student who submitted it will figure that out!

is there a certain type of tree that would make it fail consistently ?

The most recent solution that I submitted is one example.

can you provide link(s) to such solutions ?

Certain incorrect solutions can pass if you try the tests repeatedly (at least in Python - have not tested other languages).

this would require Node 20+, which is not currently available on Codewars. this cannot be considered a kata suggestions, because kata authors cannot install new language versions, only the administrators of Codewars can. you can request language versions here

It would be better if we could use toSorted() for JS.

Can someone tell me why he is not comparing to zero?
I mean, I really love this solution but i dont get it at all