Same for me.
I was wonder if the the challenge is to find as quickly as possible a big prime number list or smth else ...

Same here. I can't understand what are we supposed to do here!

The first instruction creates the module and the second returns it.
You can notice in the test's code that your module is imported by using the "require" keyword.

The way I understand is that the array should start with the longest possible sequence of unique elements, moving all duplicated entries to the end of the list without changing the order.

Same here. I'm searching all over trying to clearly define what "evenly distribute" means. At first, I thought this was a variation of the Longest Increasing Subsequence Problem, but I honestly don't know yet what the problem is. Curious and waiting!

The note is already there.

I added an expression that assumed Y at the end of a word was a vowel... that's usually when Y is a vowel, anyway...