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 vote221 views1 answer
Python in a nutshell
Python
4 votes224 views2 answers
Python declare 2d list
Python
0 vote226 views1 answer
Stemming words python
Python
0 vote231 views2 answers
Check anonim user django
Python
0 vote222 views1 answer
Funtools rougly equivalent to, internal
Python
2 votes209 views3 answers
Pandas show column types
Python
1 vote243 views2 answers
Get env variable linux python
Python
0 vote240 views2 answers
Python join multiple strings ignore none and empty string
Python
0 vote252 views1 answer
Python docx title
Python
0 vote237 views1 answer
Pandas Columns Calling using read_csv
Python