Fixed.

? In the tests mine was okay

I confirm tests generate invalid inputs see my submitted solution.

Mine also fails. Seems to be an issue with the tests.

MaxMatch starts at the first character of a sentence and tries to find the longest valid word starting from that character.

In the example provided, the results differ starting from the word them. them is a longer word than the, so them is expected to be selected as the longest valid word starting from the t.

You may want the algorithm to be able to distinguish that ["the", "middle]" make more sense than ["them", "id", "d", "l", "e"], but that is what the algorithm does. The kata is about coding that algorithm, not about segmenting the words as a human would expect.

It would eventually crash. Though, the problem desctiption states that there's always a loop, so I didn't include the null check in the while loop.

BTW: I didn't know that solution passed... if was failing on the last test (but only here on codewars for some reason).

EDIT: Please ignore my misplaced comment :)

it would most probably crash.