First clear solution for Staircase by eugene100372 - python coding challenges

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

First solution in Clear category for Staircase by eugene100372

def staircase(digits, prev=-1):
    if not digits or int(digits)<=prev: return 0
    n=1
    while int(digits[:n])<=prev: n+=1
    return max(staircase(digits[1:],prev),
               1+staircase(digits[n:],int(digits[:n])))

Sept. 21, 2023

Strings Theory

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.