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 vote107 views1 answer
Ppcm python
Python
0 vote108 views1 answer
Creating a Pandas Data Frame Series
Python
11 votes140 views3 answers
How to strip white space of text in python?
Python
3 votes167 views3 answers
Decision tree
Python
0 vote131 views2 answers
Class chain methods python
Python
2 votes110 views1 answer
Hibernate windows with python
Python
0 vote110 views1 answer
Numpy combine two arrays selecting min
Python
10 votes112 views2 answers
English to japanese
Python
0 vote131 views1 answer
Sum items in a list with ints and strings in python
Python
0 vote122 views1 answer
Tkinter yes no dialogue box
Python