Thanks for unpublishing. I really am sorry.

There is a Discord server with a #kata-ideas channel where you can ask if things have been done before ( some people have better memory than CW has search function ). That would have saved you quite a bit of time.

Note that the original kata does not have a TS translation. You could add that - solving it in Haskell or JS should not be a problem ..

yes yours looks better

You're right. Although I'd argue my problem has better wording.

wait, that might be the duplicate you are talking about

I've searched a bit before published and failed to find similiar katas. Can you please link original kata?

This is definitely a duplicate. Something with rain.

Please unpublish this kata.

What is the best time complexity one could achieve? Mine is O(n^(3/2)) and I still couldn't make it through the time limits.