Thanks for this kata.

I think the test has a serious deficiency: it does not check if the solution contains the smallest possible numbers, although this condition is stated in the problem description. Please modify the test or the description.

familiar with your solution, but with STArray (rather ugly

Dear moshtabamoshtaba,

I am sorry to say, that your solution seems to fail with input "DRLGVEQDCBKWOIRIMBXSMIIM" (expected 102497506527078530318 but got 102497506527078530317) and
"WENOJOEKEIATBXOQVVJJ" and (expected 5121906710307558 but got 5121906710307557). The problem is with // in the function P. E.g. for input "BBAA" sorted("BBAA").index("B")P("BBAA") gives 26//4=2 instead of the correct 2*6/4 = 3. Indeed there are 3 anagramms before BBAA which begin with A: AABB, ABAB, ABBA.

Yours sincerely,
zhamar

I had the same problem. As a workaround: you can change name the module you wrote from ZooKeeper to Zoo.

The Haskell check of the solution for this task is broken: "the module Zoo is missing." So I can not "attempt" my solution, although the "run sample tests" is successfull.