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

63 votes93 views3 answers
Iterate through a list
Python
2 votes124 views2 answers
Django template array index
Python
0 vote106 views1 answer
Python if string is null or whitespace
Python
0 vote131 views1 answer
General Loop Structure
Python
1 vote109 views1 answer
Get most repeated instance in a queryset django
Python
0 vote100 views1 answer
Create matrice 2d whit 3colum panda
Python
6 votes101 views1 answer
Getting dummies and input them to pandas dataframe
Python
0 vote98 views1 answer
How to take out every even number from a list in python
Python
0 vote91 views1 answer
Cv2.imwrite save to folder
Python
0 vote99 views1 answer
Python filter function using lambda function as one of the parameters
Python