I see, interesting.

Understood, thanks.

There is no test with that length, you're printing several tests input as one.

(Java)

Test input with array size 51 returns false but fails test because test expects true. Array from log:

char[] walk = {'n', 'n', 's', 'n', 's', 'n', 's', 'n', 's', 'n', 's', 'n', 's', 'n', 's', 'n', 's', 'e', 'w', 'n', 's', 'e', 'w', 'n', 's', 'e', 'w', 'n', 's', 'e', 'w', 'n', 's', 'n', 's', 'n', 's', 'n', 's', 'n', 'n', 'e', 'e', 'e', 'w', 'n', 's', 'n', 's', 'e', 'w'};

False should be correct return, right?

Each letter of a word scores points according to its position in the alphabet: a = 1, b = 2, c = 3 etc.

It matters when the strings have different size.

// with a = 1:
"aa" < "z"
// with a = 1000:
"aa" > "z"

See?

Nice job, very quick!

I understand now, thanks!

returns the first n elements - signature included of the so seeded sequence.

When n is 1, you have to return the first element of the signature.

For the Java Kata:

does the return have to be "return new String[] {};" or can it be implemented as long as a String[] is returned?