/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 vote203 views1 answer
Switch case dictionary python
Python
-1 vote206 views1 answer
Transpose 3d matrix pytorch
Python
0 vote198 views4 answers
Adaptive_average_pool-2d
Python
2 votes208 views2 answers
How to convert tensor to list tensorflow
Python
2 votes200 views1 answer
Alex john
Python
0 vote217 views1 answer
Django.db.utils.ProgrammingError: can't adapt type 'dict_keys'
Python Django
0 vote225 views2 answers
How to get username discord ext python
Python
1 vote229 views1 answer
Django filter not equal to
Python Django
5 votes197 views2 answers
Set type of column pandas
Python
0 vote195 views1 answer
Choose value none in pandas
Python