/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

17 votes338 views4 answers
Python pil resize image
Python
0 vote365 views1 answer
India states django choices
Python Django
39 votes333 views6 answers
Change column name df
Python
2 votes373 views1 answer
How to convert list to tensor pytorch
Python
35 votes342 views6 answers
Python generate random string
Python
0 vote352 views1 answer
Numpy init array
Python
0 vote330 views2 answers
Torch print full tensor
Python
0 vote334 views1 answer
Jetson nx unable to install matplotlib
Python
4 votes338 views2 answers
Queue python
Python
3 votes355 views2 answers
Flask db migrate
Python Flask