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 vote278 views1 answer
Sendgrid django smtp
Python
0 vote263 views1 answer
Numpy stack arrays vertically
Python
11 votes289 views3 answers
Python replace string in file
Python
0 vote263 views1 answer
Pandas apply pass in arguments
Python
0 vote284 views1 answer
Python os path safe string
Python
4 votes359 views2 answers
How to make never ending program in python
Python
0 vote245 views1 answer
Semicircle
Python
0 vote278 views1 answer
Drupal 8 request_time
Python
0 vote280 views1 answer
Random 2 n program in python
Python
1 vote271 views2 answers
'print(list(' empty filter
Python