/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 vote268 views1 answer
Cufflink install python jupyter
Python
35 votes255 views2 answers
Convert into date python
Python
0 vote268 views1 answer
How to clear multi dictionary in python
Python
1 vote278 views1 answer
[Solved] TypeError: can’t multiply sequence by non-int of type str
Python
30 votes258 views2 answers
Python super
Python
0 vote284 views1 answer
Values django
Python Django
0 vote253 views1 answer
Def extract_title(input_df):
Python
2 votes260 views3 answers
Group by month and day pandas
Python
3 votes273 views2 answers
TypeError: 'numpy.ndarray' object is not callable
Python
2 votes240 views3 answers
Replace newline character in python
Python