Yes this normal. There are a small number of test case. Your code may simply miss possibilities not included in the tesrs. For example in this kata the test cases do not include any two digit numbers. This could cause an error in your code if you build a string and then try to use join (Python). I made this error in my first attempt.

While I agree with the writer and upvoted the comment, there is something else to consider: the reputation of CodeWars. If the rankings are to be meaningful to others, such as employers, then it is important to root out cheaters. Otherwise the rankings have no social value.

I would like to post some of my more interesting or useful solutions to Kata in a repository on GitHub. I would change the function names to make it more difficult to search for them. Is that acceptable?

I enjoyed this one. I did not realize Python had a switch case (alpha) command. When tried to look up the command all I got was info about how to implement switch case (control flow). HA HA. Thanks smile67 for the entertaining problem.

BTW, I had no trouble understanding the current description.

I would like to post some of my more interesting or useful solutions to Kata in a repository on GitHub. I would change the function names to make it more difficult to search for them. Is that acceptable?

I am new to CodeWars, but I thought this Kata was rated too high. Perhaps its just particularly easy in Python. Are the ratings for the Kata language specific? Do others think this Kata was ranked to high?

Thank you!

I am having a diificuult time with almost_everywhere_zero. My code times out for integers around 10 ** 8 in Python. I need a more efficient way to count non-zero digits in an integer. I have tried parsing the integer as a string and also using modular arithmetic and floor division (//). Neither was fast enough. Is there an appropriate forum in CodeWars to get some help?