Could you please add some huge tests when sort fails with time limit? The point is to solve it by O(n) not O(nlogn) as sort works

Thanks for your advertency! I fixed the description

Thank you for translation! Please add a test with very long array, so solution with sorting this array will fail on time limit, and O(n) solution will pass.

Could you please add some tests into haskell (you may take it from javascript kumite)? I don't know haskell :)

I added example tests with empty strings.

I don’t see it, could you please post a link to your kumite?

How do you estimate computational complexity of your solution? (I mean the Big O notation)

The tests contain some very huge arrays, so think about performance.

Whoops, I created kumite with fix.

Go Translation kumited. Please accept :)

May be it works very long time on huge arrays?

Unfortunatelly, test cases for python and javascript is locked. I add this case to other languages and to example test cases in js and python. Thanks for report!

urllib.parse is disabled in this kata, try to write your own algorithm.

Thanks, fixed.

Try to sort your keys.