/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 vote198 views1 answer
Purpose of migration folder in django
Python Django
13 votes159 views2 answers
How to install python libraries
Python
0 vote158 views1 answer
How to extract numbers from a list in python
Python
1 vote177 views1 answer
Log base 2 python
Python
21 votes156 views3 answers
Skip rows in pandas read excel
Python
24 votes187 views4 answers
Select rows which have nan values python
Python
2 votes151 views2 answers
Random choice dictionary python
Python
7 votes175 views3 answers
Python pattern match
Python
14 votes158 views4 answers
Pandas get index of max value in column
Python
0 vote160 views3 answers
Github/hacksofteare
Python