I got it!!

sorry, my fault!

A very interesting kata!!

THANKS, THANKS, THANKS, THANK YOU !!!!

Chrono79 and joh_pot !!!

I have it!!! I have suffered a lot but now I'm very happy... "no pain, no gain". It has been worthwhile to persist trying.

A bright kata to search the best, and no simply a "good" solution...

Chrono97 Do you say object key-value or an object array? I've tried arrays, array methods, array lodash methods... same result, 60 test ok, but timeout on performance test.

joh_pot: I think I understand the basic problem in this kata. But at least, str2 must be read one time for chars, and so str1 to check if it have the chars in str2 and in the needed number... surely there is another method that is the one that I can not find to solve this.

I do not want to give up!!!

OK.

But I do not get it, and my self-esteem is at the level of the soles of the shoes. :-(

Should the correct solution employ some kind of complex sorting algorithm, or some recursion?

In the initial tests, which are 8, my code takes, for example, 300ms. How many tests are done in the final attempt? to be able to estimate what time of execution of the initial 8 I would be worth to run the full tests.

Thanks joh_pot that must be the problem, but with two array methods... although, in fact, one of the methods I use does not cover the entire array, but only until the first occurrence.
I need find another solution.

My last code use a array method and a lodash functio for array...

And yet another code, same error....

New and dif solution but same result... 60 test ok, but same error :-(