1-liner: Au creative solution for Golden Pyramid by przemyslaw.daniel - python coding challenges - Py.CheckiO

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

1-liner: Au solution in Creative category for Golden Pyramid by przemyslaw.daniel

count_gold=f=lambda p, x=0: (p[0][x]+max(f(p[1:], x), f(p[1:], x+1))) if p else 0

May 16, 2017

Comments:

sMiTeOne on Jan. 22, 2020, 10:41 a.m.
<p>WOW! Very cool!</p>

Look up in the Dict()

0

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.