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 vote306 views1 answer
Python verificar se é numero
Python
0 vote295 views2 answers
Removing rows dataframe not in another dataframe using two columns
Python
4 votes280 views1 answer
Python separate string in groups based on delimiter
Python
0 vote351 views1 answer
How to create superuser in django heroku
Python Django
0 vote334 views1 answer
Python Django Models Unique Rows
Python Django
3 votes295 views3 answers
Python check ram usage
Python
0 vote288 views1 answer
Struct trong python
Python
1 vote291 views1 answer
Python regex get string before character
Python
10 votes284 views4 answers
Write text in list to text file python
Python
0 vote285 views1 answer
Add field placeholder layout crispy modelform
Python