/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

16 votes289 views6 answers
Turtle with python
Python
0 vote282 views1 answer
Jupiter output
Python
0 vote297 views1 answer
Range coding
Python
7 votes352 views3 answers
Python flask access-control-allow-origin
Python
1 vote295 views2 answers
Change base python
Python
0 vote295 views1 answer
How to get the current line number in python
Python
0 vote277 views1 answer
Python print class variables
Python
0 vote319 views1 answer
Django versatileimagefield
Python
0 vote288 views1 answer
Counting combinations python
Python
0 vote293 views1 answer
Extract value from tensor pytorch
Python