/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 vote181 views1 answer
Difference between __gte and __lte in Django
Python Django
0 vote135 views1 answer
No module named googlesearch
Python
0 vote153 views2 answers
Python dictionary rename key
Python
-2 votes141 views2 answers
Cheese puffs
Python
16 votes125 views6 answers
Show all columns in pandas
Python
2 votes133 views1 answer
Is python easier than javascript
Python
53 votes146 views3 answers
How to find length of list python
Python
17 votes145 views4 answers
Python get average of list
Python
0 vote137 views1 answer
Tensorflow matrix multiplication
Python
0 vote135 views1 answer
Negative slicing in python list
Python