It is great, but has O(n*m) time complexity. The optimal solution to this problem is -> O(n)

Really fun little puzzle — elegant in its simplicity but still makes you think. I enjoyed coming up with a clean way to rotate the values. Thanks for the challenge!

nice!

added to java

issue not currently reproducible with OP's code - this was probably raised before the backwards-compatibility shim was added to C++

fixed

duplicate of this issue

Now works perfectly! yay, Thank You ;)

Should be fixed. Please check and re-raise if the problem still persists.

I replaced the faulty reference solution with mine and I think it works now. Can you try?

I asked someone to show me D Lang translation Solution.
I think the line c = 1 << c; should be c = 1UL << c;
Wihout this it goes over int and wrap around.
I'm new to this but I'm sure my code is correct and translation is incorrect.

i can help you haw it work do you have any platform to share with you

The format of the messages the function return doesn't seem to be uniform. Why?

Time complexity explanation != kata solution !

You should've posted this in the top-voted solution instead for better visibility of other solvers who come across reading it !

Already mention distinct here, plus the example mentioned above.

return the count of distinct case-insensitive