/Python/The grandest staircase of them all foobar solution

The grandest staircase of them all foobar solution

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 votes261 views3 answers
Making a virtual environment python
Python
-1 vote285 views1 answer
Python type checking boolean
Python
0 vote285 views1 answer
Change version of python that poetry use
Python
1 vote269 views1 answer
Append a dataframe to an empty dataframe
Python
-1 vote289 views1 answer
Parse receipt python
Python
1 vote276 views1 answer
Python scond max function
Python
0 vote273 views1 answer
Progressbar time in python
Python
1 vote278 views1 answer
From datetime to unix timestamp
Python
2 votes293 views1 answer
Django EMAIL_BACKEND console
Python
0 vote296 views2 answers
To_csv create folder
Python