Those assertions are correct, 144 / 441 cannot be the solution for the first line because you must return strictly above the lower limit, the next valid number after 144 is 256 & its permutation has the highest perfect square of 625.

Resolving: above fork already approved by someone.

Still, spoiler tag required

Good catch. Fixed.

I was able to pass the Attempt test suite in Rust without any issues. Please post your current solution, mark it as a spoiler and specify the input(s) causing your solution to fail so we may reproduce your issue and determine whether it is indeed a problem with the tests.

Closing the issue since there's insufficient evidence it's related to the Kata itself.

Thanks ;)

625 is a permutation of 256 and 144 < 256 <= 440, so it's correct.

Your own solution passes these if you increment the lower limit.

I suggest to activate these tests (kumite)

Fixed.

Thank you for reporting the bug - it's fixed!

I agree with you. Some times, the description is incomplete.

Fixed in latest fork

apologies for the late response, but it should be fixed and working properly.

Of course it was not. Has been fixed now. Though, I should have used a tuple...

The array INV contains the multiplicative inverses of the indices modulo 26 or 0 if the index is not invertible modulo 26.

Thanks for bringing this to our attention. Problem solved, no insist :)