Grandest staircase foobar

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

4 votes127 views1 answer
How to write your first python program
Python
2 votes137 views1 answer
Mulitplication symbo for unpacking in python
Python
0 vote131 views1 answer
Python pynput letter key pressed
Python
41 votes126 views3 answers
Python - sort dictionary by value
Python
0 vote119 views1 answer
Django model specify table name
Python
0 vote136 views1 answer
Python how to get variable value in dict
Python
1 vote135 views1 answer
Text size legend to bottom matplotlib
Python
-1 vote97 views1 answer
How to reverse the order of columns in matrix in python
Python
0 vote153 views1 answer
Flask google analytics
Python Flask
4 votes141 views3 answers
How to use random tree in python
Python