/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 vote280 views1 answer
Flask sending post request
Python Flask
0 vote239 views1 answer
Numpy if zero is present
Python
4 votes231 views2 answers
Python check if exe is running
Python
0 vote240 views1 answer
Django order by foreign key count
Python
0 vote219 views1 answer
Right-left staircase python
Python
1 vote235 views2 answers
Difference between == and is
Python
219 votes470 views6 answers
Random numbers python
Python
0 vote240 views1 answer
Transverse tensor in pytorch
Python
1 vote232 views1 answer
Private instance attribute python
Python
1 vote237 views2 answers
Adding numbers in python
Python