Nice kata! However (being born on 29/02/1996) I don't life the fact that the alghoritm has to force an 11, a Master number (check out its description in numerology), to become a 2, The Child, which is considered to be, in a way, its shadow, what it becomes when not truly self... Anyway, I've enjoyed it! Thanks!
Not a big problem for these tests but concatenating the arrays can use a lot of memory.
It is better to sum the arrays separately and add the sums together.
Which do you think is better?
Number()
orparseInt()
This comment is hidden because it contains spoiler information about the solution
Ruby translation kumited -- please check and approve (note: author is inactive)
Translation for java please let me know for any improvements
https://www.codewars.com/kumite/5fb99a0fe7fb84000937ebe8?sel=5fb99a0fe7fb84000937ebe8
Cool problem, not a 7
Rust translation kumited. :-)
I've updated the random tests, as they took up space and weren't truly random.
'alr approved some time ago'
F# translation
VERY GOOD PROBLEM FOR RECURSSION PRATCICE
Nice kata! However (being born on 29/02/1996) I don't life the fact that the alghoritm has to force an 11, a Master number (check out its description in numerology), to become a 2, The Child, which is considered to be, in a way, its shadow, what it becomes when not truly self... Anyway, I've enjoyed it! Thanks!
Snakey Snake Python translation
๐
Please review and approve.
Not a big problem for these tests but concatenating the arrays can use a lot of memory.
It is better to sum the arrays separately and add the sums together.
Loading more items...