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 vote131 views1 answer
Seaborn heatmap center xticks
Python
1 vote148 views1 answer
Python selenium itemprop
Python
2 votes135 views2 answers
Densenet python keras
Python
0 vote138 views2 answers
Java to python conversion
Python
4 votes157 views2 answers
Declare array with given size python
Python
2 votes127 views1 answer
Give a function a name python
Python
0 vote159 views1 answer
How to make python do something every x seconds
Python
0 vote171 views1 answer
How to get wikipedia photos using wikipedia module ip python
Python
0 vote137 views1 answer
Plot function in numpy
Python
0 vote136 views1 answer
How to import sin and cos in python
Python