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

84 votes409 views2 answers
Python with statement file does not exist exception
Python
0 vote197 views2 answers
Install python 3.7 from source in ubuntu linux
Python
0 vote207 views1 answer
Python warn vs warning
Python
0 vote205 views1 answer
Python running mean pandas
Python
0 vote183 views1 answer
Import combination
Python
186 votes294 views6 answers
Pip upgrade command
Python
0 vote197 views2 answers
How to make a function input optional in python
Python
0 vote203 views1 answer
Django edit model without loading from db
Python
13 votes215 views4 answers
How to count number of unique values in a column python
Python
0 vote232 views1 answer
Replace NaN value in pandas data frame with zeros
Python