/Python/The grandest staircase of them all foobar solution

The grandest staircase of them all foobar solution

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

1 vote73 views1 answer
Importerror no module named 'cffi'
Python
17 votes108 views2 answers
Count lines in file python
Python
11 votes137 views5 answers
Python discord mention user
Python
23 votes111 views6 answers
Read pickle file python
Python
1 vote105 views1 answer
Python MongoEngine doc
Python
0 vote112 views1 answer
Y=mx+b python
Python
1 vote119 views1 answer
How to check whole number in python
Python
0 vote212 views1 answer
Python pid control
Python
18 votes120 views2 answers
Foreach loop in python with index
Python
54 votes120 views3 answers
Python add up values in list
Python