I am feeling a little simple as I haven't figured out how the series is generated from line to line
Your solution is so terse my version is so verbose
I will try. Looking at the number we can see the smallest digit is 1 which appears in the number in several places, at positions 6,7 and 10 using 0 based indexing.
We choose the the last occurence of the minimumal digit to find the smallest number, so we can tranformer the number say to an array or string to using the built in
How is this a 5kyu?
Yes, it is working. Because cata has bad tests :)
Okay, n is always positive, so it would never be 0.
But you can try something else, for example - 40585.
// 4! = 24
// 0! = 1
// 5! = 120
// 8! = 40320
// 5! = 120
Correct => 24 + 1 + 120 + 40320 + 120 = 40585
In your case => 24 + 0 + 120 + 40320 + 120 = 40584 (wrong...)
This solution is fine for the kata requirements, because the n is always positive, so it would never be 0.
Oh OK the solution works so I am not bothered really. I can't remember how long ago I wrote this tbh. It still managed to get 6 best practice recommendations and 5 clever so I am cool with it
Yes, it is a comment on your solution.
I am confused is this comment regarding my solution
Wrong, try strong(0). It will return 'STRONG!!!!', but 0! = 1, so 0 != 1...
Also, the map is not necessary
If you have the time could you possible explain your algorithm for this problem please