Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Recursive solution in Clear category for Stair Steps by DiZ
def checkio(n):
if not n: return 0
if len(n) == 1: return max(0,n[0])
return max(n[0]+checkio(n[1:]), n[1]+checkio(n[2:]))
May 19, 2014