Sorry but can you explain this so my smooth brain can understand?

Approved :)

I'd say it'll do.

Is this one ok to be approved?

Yes, my point was just to update the translation since it seemed ok.

Is this still in an old GHC version ?!? It's missing module in testing.

I'm forking it now, do some light touching up.

I much like your the use of elemIndices though!

You forgot about the existence of words and unwords, didn't you? ( Don't worry, I often do as well. )

ETA: Looks like OP did and you didn't want to change his solution. I have so such compunction tho.

You can do this in Haskell easily without a timeout, how you filter them is the critical part.

For example how would you do this in Haskell :

-generate all the numbers from 1 to 50 bazillion
-filter the numbers which are equal to 69
-return the remaining list

That's the wrong question. The correct question is, it's not specified at all how 1 is handled.

I've changed the input range to n > 1. Given that 1 should be omitted it doesn't make sense for 1 to be the input anyway.

I don't know how to work it out

Yeah. Doing that hurt a little.

Great job!

@myjinxin2015 I forked it and applied my changes again, now it does not complain anymore:

https://www.codewars.com/kumite/5ac67a6c348c22cc2f0000a1?sel=5ad12e1019f54432fb000013

I would say it is ok giving my beginners knowledge of haskell and codewars :D