Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
1 line, recursion solution in Clear category for Stair Steps by kdim
def checkio(n):
return max(n + [0]) if len(n) < 2 else max(n[i] + checkio(n[i + 1:]) for i in (0, 1))
March 9, 2021