Hi,

I did not see any mention of that in the description. The 1110000000111 test case is not ambiguous:
since you cannot divide 7 by 3, the only possible speed is 1, while a minimal length algorithm will find that it is 3.
I totally get that you want to orient people toward the minimal length solution for the next kata, and that is what most people who did not think about that case will do. But if you think about that case before coding - as me and probably a lot of people did - then it makes things more complicated.

If you do not want to add this as a test case, then you should add it in the description, stating that the word separator length (0000000) is unreliable to find the speed.

Same error here, I can't pass that test.
The note about what is considered randomness is extremely vague.
I have tried what was suggested above: limiting the number of occurrences of each character in a password to 33% / 50% (tested each), but it still doesn't work.