/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

14 votes191 views6 answers
Django install
Python
0 vote214 views1 answer
Python get chars among quotation marks
Python
-1 vote223 views2 answers
Django view
Python Django
1 vote201 views1 answer
Xarray add coordinate
Python
-1 vote196 views1 answer
Group by data
Python
1 vote191 views1 answer
Python shortest path of list of nodes site:stackoverflow.com
Python
0 vote187 views1 answer
Plot circles in matplotlib
Python
1 vote201 views1 answer
Python permission denied
Python
0 vote177 views1 answer
Turn numpy function into tensorflow
Python
1 vote195 views1 answer
Matplotlib wrap title
Python