how's this?

https://www.codewars.com/kumite/66e2d44e259739d800172285?sel=66e2d44e259739d800172285

3 years later, and because of ranking inflation, this (in my eyes) would be a solid 6 kyu puzzle right now.

10-adic numbers

according to Google: "10-adic numbers are base-10-expressed numbers that have an unlimited number of digits to the left of the decimal point"

If the description means "numbers in base 10", it should not specify "10-adic numbers".

Numbers that don't contain 00 are called Blind Numbers. Count .. that are not Blind Numbers. So that do contain 00.

And then the example excludes numbers that do contain 00.

Either the description is wrong, or it contains so many negatives I lost track, and should be improved.

Haskell translation

Hmmm I have an O(1) solution, but the numbers get really big before I can convert to int and perform the modulo operation ...

any suggestions?

wow this was nice

i really like it!

Have you copied/pasted the post from iso4free? Then you could have read the answers there instead of posting exactly the same question again.

You can print the inputs - see here.

When i ty to submit my code i have next results: Passed: 111 Failed: 1 Exit Code: 1 In Edge Cases: True should equal False But how i could know which test data cause test fail?

is mispelled(n) misspelled on purpose? :)

This solution always returns a new object

how is this best practice?

Considering the third case first may help.