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

7 votes336 views1 answer
On message discord py
Python
0 vote344 views3 answers
Online kivy
Python
0 vote388 views1 answer
Pandas drop 1970
Python
0 vote344 views1 answer
Fork function in python
Python
0 vote324 views1 answer
Ai chatbot python
Python
0 vote387 views1 answer
Qspinbox value changed
Python
1 vote313 views2 answers
Organize order columns dataframe
Python
0 vote340 views1 answer
Check two list python not match
Python
1 vote322 views1 answer
How yo import python lib
Python
2 votes297 views1 answer
Django.core.exceptions.improperlyconfigured: wsgi application 'backend.wsgi.application' could not be loaded; error importing module.
Python