/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

0 vote259 views1 answer
Difference between __gte and __lte in Django
Python
0 vote227 views1 answer
Python n periods of std
Python
0 vote247 views1 answer
Python datetime floor to hour
Python
0 vote233 views1 answer
Create contract from interface in brownie
Python
4 votes217 views1 answer
Df.sort_values(by='col1',asending=True)
Python
0 vote257 views1 answer
How to pass primary key to url django
Python
6 votes235 views2 answers
Python writeline file
Python
2 votes256 views1 answer
How to maker loops coun t in second in pytho
Python
2 votes206 views1 answer
Check if part of list is in another list python
Python
1 vote237 views1 answer
Increase contrast cv2
Python