/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

0 vote113 views1 answer
How to incorportate a different language in python code
Python
0 vote109 views1 answer
Np shuffle
Python
0 vote121 views1 answer
What is certifi module in python
Python
0 vote115 views1 answer
Hh:mm to mins in python
Python
3 votes124 views2 answers
Variance calculation python manually
Python
0 vote137 views1 answer
Python bot ban script
Python
0 vote106 views2 answers
Django create view filter options
Python
1 vote118 views1 answer
Xarray add coordinate
Python
13 votes115 views4 answers
Even in python
Python
6 votes99 views2 answers
Numpy from csv
Python