Thank you! I got used to the fact that the minimum and maximum numbers are in the array itself. I should have read the condition more carefully.
Thanks again!

The instructions say: "You are given an array containing all integers from 1 to N, except one that is missing."
In this exemple, N=6 (it is the size of the input array) so the missing number is indeed 6.

Third test in attempt - [2,3,1,3,4,5] "pending" [6,3] ???
How can that be? Where does 6 come from?

.

.

asd

The line of code const message = "Just throw like this!"; returns the error Error: I think you are cheating, your code have throw.

lol

Good point. Resolved.

Shouldn't '[]' be removed in optimization?

I went ahead and edited ZahNarztiK's Javascript translation. It contained typo in solution (was checking c instead of c[0]). Also, added couple cases to test repetition of .. and ,,.

asd

That is actually not the intended way to pass that test, no.

I have mixed feelings to hear you are struggling. I sincerely hope it's not too frustrating. I did intend to challenge people though, and I am happy to hear that seems to be working. :P I did not dare set a ranking myself, but I am happy with what has to be Voile's. :]

But if the problem is confusing, or really too little, specification, please let me know.

Meanwhile, take the hint Voile mentioned. It's for this test exactly.

Aside: I have a kata specifically on foldr in the pipeline. That one might actually be a nice workup towards this kata. It'll be too late for you (sorry), but it might help other people when it's published; at least you should have less problems with that one after you've solved this one. It's a fun one! :]

Voile, you haven't seen this kata's part II yet! There is .. and it's more challenging .. but I would like some solutions on this one first. ( It's still a draft kumite, not yet a draft kata. )