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 vote205 views1 answer
Get list of users django
Python
0 vote223 views1 answer
Logistic regresion heart disease python
Python
71 votes207 views4 answers
Saving a pandas dataframe as a csv
Python
2 votes200 views1 answer
Python capitalize the entire string
Python
1 vote196 views1 answer
Python multiplication array
Python
1 vote207 views1 answer
Godot spawn object
Python
0 vote196 views1 answer
Fnd closest element in array numpy
Python
2 votes186 views2 answers
How to take input in python3 separated by space
Python
1 vote205 views1 answer
How to fix turtle has no member
Python
1 vote200 views2 answers
Group by dateime pandas
Python