/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

10 votes165 views5 answers
Find nan values in a column pandas
Python
3 votes176 views1 answer
Join two numpy 2d array
Python
1 vote158 views1 answer
Django queryset average of unique values
Python
1 vote154 views1 answer
Removing features pandas
Python
-1 vote172 views2 answers
Python datetime minus datetime
Python
82 votes148 views5 answers
Python requirements.txt
Python
-2 votes173 views1 answer
Calculate sum in 2d list python
Python
11 votes151 views2 answers
__str__()
Python
6 votes179 views1 answer
Python soap
Python
0 vote191 views1 answer
How to get cube root python
Python