It also does 2 linear scans (to know if the targets are in the words) and then another 2 to get the indeces

In Kotlin, forcing the result to be an IntArray is complicating the solution unnecessarily, as it prevents nicer solutions just to put the result back into that data structure.

The problem is in the

if input_.lower() in word.lower() and cnt < max

line, remember that you should check for the dictionary entry starting with the input, not just containing it

I'm still having this issue, in particular with this kata: http://www.codewars.com/kata/52742f58faf5485cae000b9a/

Seems like this was fixed by Katzen_gott but not merged yet :( https://github.com/Codewars/code-grouper/pull/2

It would be nice to disable sum and reduce in the tests, so that solutions are not permited

Would be super fun to either add or create a harder version of this, adding slicing and/or iteration to the things that need to be implemented

I think itertoools.product could be disabled as well, in order to make it a bit more challenging (and avoiding the recipes that Python's doc gives)

From a OOP perspective, I'm not sure about having God being a function at all. I know this is supposed to make people work on their language skills, but the as it's supossed to be talking about classing, maybe using a better OOP layout would work better. (Maybe God being a class itself, and an instance method "create_humanity"? No theological discussion intended, so let's not talk about singletons)

Nevermind, I found a couple of bugs and finally solved it ;)

Implementing in Pytho, I keep getting:

Process was terminated. It took longer than 6000ms to complete
0 Passed
0 Failed
0 Errors

The tests and examples shown work ok for my code, and I'm pretty sure the implementation is efficient enough. Any ideas of what might be happening?