done

Wouldn't using frequencies instead of sort be better in terms of runtime complexity? It is my understanding that sort uses tim-sort---and thus is in O(n * log(n))---while frequencies is in O(n).

A reference solution.

Can you enlighten your algo?

Yeah, I'm kind of desperate over this as well. And too busy to write an actual bug report. Any help appreciated..

Something is wrong. I'm continuously getting the message "Submission timed out while communicating with our servers". While basic tests have passed successfully and rather fast (23ms for the maze 13x6).
Usually for slow solutions I get some output and the message "Process was terminated. It took longer than 10000ms to complete".

Great kata!

Please fix '//' comments in clojure basic tests.

Well, never mind. I've done it better.

Hi

I just tried my solution and it passed in 3458ms, so I don't think there is any problem with the tests : )

Maybe there are too much random tests for clojure. My solution passes 68 tests but it takes more than 10000ms and so overall execution fails.