Not bad, it has a time complexity of O(n^2), but for a fixed array size it's just fine.

наша русофобія недостатня!

ультра супер мега хорош

база, чо

не позорте

Топчик, уже злой, что аж зубы скрипят, от того, какие тут условия задачи люди строчат, а тут решение до улыбки довело)))

наш человек

the best!!!

лучший

I didn't see the replies until your comment Andrew, but now that I come back to it I don't see why it would break for long words. I think I saw indexOf and thought charAt or some such thing. I don't know, this looks like it works to me.

Also I don't get the FUD about using regex, they're not slow in general. Some regex can be slow, but one that looks for a single digit is as fast as indexOf.

@prohairesis Give it a check, the function indeed breaks for really long words.

Базовано :D