/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

9 votes189 views3 answers
Print for loop in same line python
Python
0 vote228 views1 answer
Python increment char a to b az to ba
Python
0 vote189 views1 answer
Panda Python - Calculating what percentage of values are true and false out of total in boolean column
Python
0 vote195 views1 answer
Var colors python
Python
9 votes196 views6 answers
Pattern python
Python
41 votes199 views6 answers
Replace nan with 0 pandas
Python
1 vote237 views1 answer
How to custom page not found in django
Python Django
0 vote200 views1 answer
Open link in tab new trong selenium python
Python
0 vote217 views2 answers
Stable version of django
Python Django
4 votes221 views1 answer
Eigenvectors python
Python