To recurse is divine creative solution for Digits Multiplication by dknn - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

To recurse is divine solution in Creative category for Digits Multiplication by dknn

checkio=lambda n:(n%10or 1)*checkio(n//10)if n else 1

#These "asserts" using only for self-checking and not necessary for auto-testing
if __name__ == '__main__':
    assert checkio(123405) == 120
    assert checkio(999) == 729
    assert checkio(1000) == 1
    assert checkio(1111) == 1

Aug. 2, 2014

Comments:

lesenv on Nov. 29, 2014, 11:48 p.m.
phew, i had to think about this solution... wow. does n//10 automatically decrease n?

sumeet.lintel on Jan. 8, 2015, 11:42 a.m.
Your solution is one of the speediest solution, I suppose. Although it is creative but it can also land in speedy section

sumeet.lintel on Jan. 8, 2015, 11:46 a.m.
In you code, function is called d+1 times , where d is no. of digits. It can be called only d times by using <pre class='brush: python'>if n//10 </pre>

M157q on Nov. 5, 2015, 12:23 p.m.
recursion!!

hezhe88 on Nov. 16, 2015, 10:54 p.m.
TIL: lambda recursion

U.V on Sept. 30, 2022, 8:36 p.m.
Exellent solution with lambda-recursion !

Strings and Integers

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.