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

2 votes343 views1 answer
Tensorflow reduce_sum
Python
0 vote329 views1 answer
Django auto increment field
Python
0 vote352 views1 answer
Docker remote
Python
60 votes361 views4 answers
Csv python write
Python
0 vote342 views1 answer
How to print list without newline
Python
0 vote334 views2 answers
Python parameter with default value and type
Python
0 vote344 views1 answer
Promote a row in panda dataframe to header
Python
0 vote347 views1 answer
Python loop over s3 objects]
Python
25 votes380 views4 answers
Time in python code
Python
0 vote381 views1 answer
Plot path in pillow python
Python