Grandest staircase foobar

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 vote371 views1 answer
Multiprocessing map
Python
1 vote346 views1 answer
Py hello code
Python
0 vote379 views1 answer
Line plot python only years datetime index
Python
0 vote360 views3 answers
Install python homebrew
Python
0 vote328 views1 answer
Minio python remove a bucket
Python
17 votes347 views4 answers
WARNING: You are using pip version 21.2.3; however, version 21.2.4 is available
Python
1 vote344 views3 answers
Management commands django
Python
0 vote352 views1 answer
Pygame pin to top
Python
1 vote328 views1 answer
Python two while loops at same time
Python
-1 vote350 views1 answer
Exchange sort python
Python