Grandest staircase foobar

def solution(n):
    m = [[0 for i in range(n + 1)] for j in range(n + 1)]
    m[0][0] = 1  # base case
    for stair in range(1, n + 1):
	    for left in range(0, n + 1):
	        m[stair][left] = m[stair - 1][left]
	        if left >= stair:
	            m[stair][left] += m[stair - 1][left - stair]
	          	
    return m[n][n] -1

Source: livecodestream.dev

Similar codes

0 vote112 views1 answer
Django oauth toolkit permanent access token
Python
1 vote113 views1 answer
How to add three conditions in np.where in pandas dataframe
Python
1 vote112 views1 answer
Discord.py send messages
Python
6 votes109 views1 answer
How to get the calendar of current month in python
Python
0 vote118 views1 answer
Convert 2d string array to float python
Python
1 vote117 views2 answers
Python rgb colors
Python
-1 vote110 views1 answer
# get the largest number in a list and print its indexes
Python
0 vote115 views1 answer
Datatime add time in float
Python
0 vote104 views1 answer
Input lstm
Python
0 vote119 views1 answer
How to convert a matrix string back to a matrix python
Python