Not too hard. Only the description is hard to understand and I was about to give up. For example, what am I supposed to do if babyDontHurtMe = true and noMore = false? This is not clear and I had to do a lot of tests to succeed.

Nice one. Very hard too.

I like the idea. I just wonder if my recursive solution is faster or not.

Set the initial value of your reduce to 0

I like this one. Using the array coming from match is very interesting and new to me.

Very clever. This is a new pattern to me.

Nice one. Mine is similar, but I forgot I could use match() directly as an array. Bravo and thanks for giving us this great solution.

I give up. Can someone tell me please why I'm getting this weird result?

expected
[ -22, -16, -9, -8, -12, -12, -13, 10, 6, 9, 19, 19, 10, 18, 20 ]
to deeply equal
[ -22, -16, -9, -8, -24, -12, -13, 10, 6, 9, 19, 19, 10, 18, 20 ]

It looks like there's a bug in my code or maybe the problem is with the tests. Any theory about it?

If you don't know what "?" means, why did you use it in your solution?

Now I see!!! LOL. Thanks a lot for the help, man. You saved my life!

Time: 631ms Passed: 13Failed: 0
Test Results:
Tests
test
(13 of 13 Assertions)
Completed in 5ms

Where can I find the original issue, please?

Does it mean it doesn't work in javascript? Should I give up?

I spent hours solving this problem. It works well on my ide. But here I keep getting this :
Time: 662ms
Test Results:
Solution
should test for something
Completed in 4ms

Should I consider this a failure? I'm very confused because this is the first time I get this sort of message.

Using eval is not a problem if you know what you are doing.

NaN is not a string. According to the description, only strings should be filtered out.