/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

19 votes307 views1 answer
Get requests from python
Python
13 votes329 views3 answers
How to combine two lists in one python
Python
12 votes306 views5 answers
Python random uuid
Python
7 votes329 views3 answers
Pandas replace nonetype with empty string
Python
3 votes477 views1 answer
Python list to tensor
Python
0 vote300 views1 answer
Python proxy scraper
Python
1 vote314 views1 answer
Python get os cores
Python
0 vote398 views1 answer
Django cms create page programmatically
Python Django
0 vote371 views1 answer
Trim all new rows string python
Python
-1 vote300 views1 answer
How to print multiple integers in python in different line
Python