Okay, thank you.

Разобрался? Потому что меня уже гнилыми помидорами закидали, причём сформулировать что всё-таки нужно сделать никто не хочет.

Либо выбрать самую длинную строку + n-строк по второму аргументу, либо взять первую и n-строк, как пишут в комментариях, но тогда это не сочетается с примерами кода.

@OlegSonin: you should read this whole thing. It was created specifically for people like you who do not enough masterize cw' environment yet. Lots of useful info for you in there.

cheers.

Your task is to return the first longest string consisting of k consecutive strings taken in the array.

You can make two strings of 2 consecutive strings taken in the array there:

"Hellolongest" length 12
"longestworld" length 12

"Hellolongest" is the first one, they have the same length.

First string most longest string, longest string in array is "longest". Why "Hellolongest"? Look at the "Sample Tests".

longestConsec(["Hello", "longest", "world"], 2) // The result for this test should be "Hellolongest", your function returns "longestworld"

My code is looking for the longest string anywhere. Test it.

https://pasteboard.co/JjzQ08B.jpg

if n = 0 or k > n or k <= 0 return "".

Isn't that in the instructions? Read them again.

@EmperorMigx Thank you with your explenation I was able to finish the exercise within couple of minutes, before I struggled for hours. THe explenation of the exercise is really not clear writen.

And how exactly is it broken?

Just: $dupCount++