Looks like the reference solution is incorrrect. I've raised a new issue for this.

JS: The Reference solution is incorrrect, as pointed out by ajbrin below:

input: pdBkMp tEt-fUEa Oupu-uqpez SeYTjMHtwS NnkzRJW

Expected: '['Oupu-uqpez', 9]', instead got: '['SeYTjMHtwS', 10]'

Should specifiy which to return when there are more than 1 word that has the maximum length;

JS: Node v14 should be used along with its appropiate assertion tools (Mocha + Chai).
Refer to this and this

input: pdBkMp tEt-fUEa Oupu-uqpez SeYTjMHtwS NnkzRJW

Expected: '['Oupu-uqpez', 9]', instead got: '['SeYTjMHtwS', 10]'

???

Removed it, but this kata seems way too broken to even bother fixing other stuff...

Fixed

There's some weird wordFinderAuth tests at the end; I don't know what those are for.

Oh wait, and I forgot to mention there were no random tests :(

Maybe you can add a twist. For example, I don't seem to recall any kata which requires you to return all instances of words which has the same maximum length.

Ahh sorry, this was my first go at creating a kata lol. Will get better at fresh ideas as I make strides! Thanks for the feedback!

Duplicate of this kata, and definitely many more (I can't seem to find them handily right now, but this concept has been done to death).

awesome!

nice refactoring