does this work with unicode characters, like É, etc? I thought len breaks them by bytes, not runes.

this is excelent!

Please use spoiler flag next time.

This is the "best" O(n) solution I was looking for.

The solutions using Array.sorted() are elegant, but Timsort is O(nlog(n)) time complexity.

em.....Brilliance!

The kata description says, "You don't have to worry with strings with less than two characters."

it show an error:

slice out of bound

this solution can be improved!

good catch!

What if word is an empty string?

Learning the built in libraries is important, but I feel this solution skirts around the problem. i.e) If the function name in the sort library was InAscOrder instead of IntsAreSorted, then you would call "return sort.InAscOrder(numbers)". Do you see my point? If you think I'm wrong, please let me know the time complexity of your solution.