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 vote119 views1 answer
How to convert cost to float in python
Python
15 votes189 views4 answers
Q django
Python Django
0 vote210 views1 answer
Tf.slice
Python
0 vote118 views1 answer
Delete column matlab
Python
0 vote186 views1 answer
Count entries groupby
Python
0 vote118 views1 answer
Python format inverse
Python
8 votes133 views4 answers
Normalize data python pandas
Python
4 votes137 views3 answers
Gui python
Python
217 votes341 views6 answers
Python random number generator
Python
0 vote121 views1 answer
Open word from python
Python