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

1 vote195 views2 answers
Python hasattr function
Python
2 votes220 views2 answers
Pandas set options
Python
-1 vote186 views1 answer
Add border to table in python pptx
Python
1 vote201 views1 answer
Python parallel list comprehension
Python
1 vote195 views1 answer
Biggest of 3 numbers in python
Python
0 vote217 views1 answer
[Solved] Pandas TypeError: no numeric data to plot
Python
0 vote190 views1 answer
Multiply every nth element
Python
1 vote256 views1 answer
How to add decorators with class in django
Python
-1 vote196 views2 answers
Percent to number python
Python
1 vote197 views1 answer
How to print time python 3
Python