I totally agree with you. This is where the work is done in an array within an array. I saw a great solution here via replace and regExp

It will be considered part of a word and just stays as it is. But the tasks specifies that the input consists only of letters and (single) spaces.

Not all nested loops are inherintly O(n^2). And it is a case here as I explained here

Who the h..l selected current solution as "Best practice" ? Does anybody measures execution time of the functions in here and resources usage ?
or even READABILITY. Give me a break .

April fools

I never worry about big O when doing these.

Isn't it the whole point of these coding tasks — to find a performant solution (in terms of big O)?

For anyone looking for a simple and easy to understand one line solution, look at my solution

Clearly they weren't worrying about big O. I never worry about big O when doing these. Most people go for succinct solutions over performant one

wow

Yeah, basically wrote the same solution. Great job!

What happens if a hyphen is encountered?

it took me 3 days still my code sucks :(

That is exactly what I did.

sorry,I thought I labeled it