I created a translation of this kata into Python: https://www.codewars.com/kumite/5d95a3e7ab4aad0022dbf303?sel=5d95a3e7ab4aad0022dbf303

Ah, sorry. Should I instead publish a translation of https://www.codewars.com/kata/513fa1d75e4297ba38000003?

Thanks for your feedback! I have changed the instructions to say 150 instead of 100.

You could make random test cases, and check them with your solution. The main thing you should consider when doing this is to make sure that the code doesn't time out.

You should probably add more test cases, since 3 is pretty little.
Also, the initial solution says:

def letter_pattern(words, n):
	return ""

There's no mention of anything to do with 'n', the solution has nothing to do with 'n', and none of the calls to the function have the argument 'n'; omit the 'n' from the initial solution.

I changed the testing code a bit; try again and see if it is good.