/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 vote224 views1 answer
Snipe cmd python.py
Python
2 votes262 views2 answers
Python program to check fibonacci number using functions
Python
1 vote258 views1 answer
View whole dataset in python
Python
0 vote257 views1 answer
How to save string json to json object python
Python
0 vote273 views1 answer
How to format a matrix to align all rows python
Python
0 vote299 views1 answer
Autopytoexe
Python
0 vote281 views1 answer
Open file in python network url
Python
0 vote286 views1 answer
Django oauth toolkit permanent access token
Python
0 vote269 views2 answers
Stackoverflow search
Python
0 vote409 views1 answer
OduleNotFoundError: No module named 'absl'
Python