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

2 votes354 views1 answer
How to open incognito tab using webbrowser
Python
0 vote355 views1 answer
Flask sqlalchemy case insensitive like
Python
0 vote310 views1 answer
List of words from a string and filter them based on a secondary list
Python
2 votes313 views1 answer
Slice columns from dataframe
Python
1 vote327 views1 answer
Not getting spanish characters python
Python
0 vote333 views1 answer
Pycache in gitignore
Python
0 vote298 views1 answer
Na in python
Python
0 vote301 views1 answer
Sendgrid send email to multiple recipients python
Python
2 votes350 views2 answers
Python selenium full screen
Python
0 vote289 views1 answer
Django dump previous migrations
Python