/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 vote149 views1 answer
Find maximum value by if else python
Python
0 vote133 views1 answer
Django template datetime-local
Python
0 vote305 views2 answers
Class range python code
Python
0 vote134 views1 answer
Unpacking using List in Python
Python
2 votes127 views2 answers
Python redis
Python
0 vote138 views1 answer
Majority in array python
Python
0 vote134 views1 answer
Labelencoder update
Python
0 vote145 views1 answer
All letters an numbers py array
Python
1 vote142 views1 answer
Characters python
Python
0 vote140 views1 answer
How to use assert in python
Python