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

0 vote173 views2 answers
Np array to tuple
Python
55 votes186 views3 answers
Python read values from file
Python
0 vote164 views1 answer
Is python platform independent
Python
20 votes214 views3 answers
Discord.py change status
Python
0 vote183 views1 answer
Comment arrêter un jeu en appuyant sur une touche python
Python
0 vote196 views1 answer
Not staments python
Python
2 votes143 views2 answers
Python generate all combinations
Python
0 vote186 views1 answer
Numpy bitwise_or multiple images
Python
2 votes225 views1 answer
Check if user log in flask
Python Flask
1 vote194 views2 answers
One hot encoder python
Python