/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 vote137 views1 answer
How to sort a list of dictionary by value in descending order?
Python
23 votes132 views1 answer
Python minute from datetime
Python
7 votes185 views1 answer
How to find the location of a character in a string in python
Python
1 vote121 views2 answers
Git help
Python
0 vote142 views1 answer
Form rendering options in django
Python
82 votes135 views6 answers
How to create a for loop in python
Python
0 vote131 views1 answer
Randomforestclassifier fit sklearn
Python
5 votes150 views1 answer
Pandas predict average moving
Python
3 votes143 views1 answer
Clean punctuation from string python
Python
0 vote173 views1 answer
Calculate quartil python
Python