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

8 votes272 views3 answers
Calculate Euclidean Distance in Python
Python
17 votes223 views5 answers
Python input integer
Python
0 vote243 views1 answer
Values django
Python
2 votes232 views1 answer
Sqlite operational error no such column
Python
18 votes217 views4 answers
Bubble sort in python
Python
0 vote238 views2 answers
How to sum a column in Python csv
Python
0 vote232 views1 answer
Check python version conda env
Python
1 vote239 views1 answer
Python create a matrix with one in diagonal
Python
0 vote245 views1 answer
Query first 5 element in django
Python
0 vote214 views1 answer
How to set variable in flask
Python