/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 vote122 views1 answer
Python "in magic method"
Python
0 vote134 views1 answer
Check object attributes python
Python
18 votes129 views6 answers
Installing django
Python
3 votes82 views2 answers
Python functional foreach
Python
0 vote124 views1 answer
Creating rest api in serverless with python
Python
11 votes117 views2 answers
Python datetime yesterday
Python
0 vote132 views1 answer
Knn example
Python
0 vote131 views1 answer
How to create new header of a dataframe in python
Python
0 vote131 views1 answer
Min of two numbers python
Python
0 vote121 views1 answer
Restore tf model python ValueError: Unknown loss function:smoothL1
Python