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 vote265 views1 answer
Prevent list index out of range python
Python
0 vote273 views1 answer
Date-fns difference in days
Python
0 vote300 views1 answer
Displace items in array python
Python
0 vote340 views2 answers
Render template in django
Python Django
69 votes271 views3 answers
How to check if character in string python
Python
13 votes261 views6 answers
How to define a dictionary in python
Python
2 votes292 views3 answers
Combine list of dicts
Python
7 votes292 views4 answers
How to get all the keys of a dictionary in python
Python
1 vote275 views2 answers
Python pyqt5 table widget remove horizontal header
Python
10 votes288 views6 answers
Variable in python
Python