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 vote194 views1 answer
Filter directory in python
Python
2 votes100 views1 answer
How to turn list into dataframe inr
Python
2 votes111 views1 answer
How to separate a string or int with comma in python
Python
6 votes146 views2 answers
Python selenium save cookies
Python
0 vote144 views1 answer
How to open html file in python
Python
0 vote147 views2 answers
Return returns string with brackets python
Python
0 vote200 views1 answer
Django model different schema
Python Django
1 vote149 views1 answer
Ursina python
Python
0 vote142 views1 answer
Python dictionary get keys with condition on value
Python
0 vote149 views2 answers
Arithmetic in python
Python