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 vote181 views1 answer
Nested for loop table python
Python
29 votes179 views2 answers
Lambda en python
Python
1 vote228 views1 answer
How to set "Unnamed: 0" column as the index in a DataFrame
Python
1 vote212 views1 answer
Use incognito in selenium
Python
0 vote190 views1 answer
Qcut and cut function in python stack overflow
Python
1 vote192 views1 answer
Cprofile usage python
Python
-1 vote184 views2 answers
Np.apply_along_axis third dimension python
Python
2 votes176 views1 answer
Torch device
Python
0 vote218 views1 answer
Corona data with python flask get pdf
Python
0 vote228 views1 answer
Python hello world web application
Python