Most likely it indicates that your code runs out of time, as the input n is in range [0, 10e6] and (10e6)! has more than 50e7 digits. Both computing n! (multiplying for big integer is expensive too) and extracting digits from n! by dividing 10 forms performance bottleneck.
I would suggest the log template being
You should 'pig' "{input_str}": '{output}' should equal '{expected}'You are missing a zero in the actual result, check if you if-else branch left that condition unhandled.
Most likely it indicates that your code runs out of time, as the input n is in range [0, 10e6] and (10e6)! has more than 50e7 digits. Both computing n! (multiplying for big integer is expensive too) and extracting digits from n! by dividing 10 forms performance bottleneck.
See https://en.wikipedia.org/wiki/Node_(computer_science).
As for "why don't we speak 'Node' much when using python", I would suggest u read a similar question on so, it answered my similar concern.
The above recursion terminates at
n+1whensum (Σ(i^3) for i in [0, n+1))equalsm, returningn+1, which is not actually accumulated tosum.