/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

75 votes263 views2 answers
Open and write in a file in python
Python
0 vote327 views1 answer
Django rest framework default_authentication_classes
Python Django
0 vote278 views1 answer
Infinity range or infinity looping
Python
0 vote278 views1 answer
Subtract layers
Python
0 vote279 views1 answer
Python download video from instagram
Python
0 vote296 views1 answer
Remove whitespace around figure matplotlib
Python
1 vote274 views1 answer
Simple way of finding file extension python programming
Python
1 vote296 views1 answer
Django gmail smtp
Python Django
0 vote276 views1 answer
Return all values in a list python
Python
0 vote227 views1 answer
Dip programming language
Python