/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 vote176 views1 answer
Python rolling mean
Python
0 vote164 views1 answer
CMake Error at pybind11/tools/FindPythonLibsNew.cmake:131 (message): Python config failure:
Python
-2 votes161 views1 answer
Youtube dl python
Python
1 vote157 views1 answer
From time import sleep, time
Python
0 vote182 views1 answer
Label default text value python
Python
-2 votes165 views3 answers
How to insert a banner in html
Python
0 vote166 views1 answer
Comment arrêter l'exécution d'un programme python
Python
0 vote157 views1 answer
Get list of users django
Python
8 votes157 views2 answers
Print list in one line python
Python
1 vote168 views2 answers
Keras sequential layer
Python