/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 vote219 views1 answer
Comment a lot of lines python vscode
Python
123 votes213 views6 answers
Input python
Python
0 vote227 views2 answers
How to import image in python
Python
18 votes232 views4 answers
Remove n characters from string python
Python
0 vote223 views1 answer
Additon of multiple duration timestamps python
Python
1 vote189 views2 answers
Fibonacci python
Python
1 vote199 views1 answer
Complete the function digits(n) that returns how many digits the number has.
Python
4 votes221 views4 answers
What does afk mean
Python
0 vote208 views1 answer
Python cv2 read image grayscale
Python
1 vote206 views1 answer
How to refresh windows 10 with python
Python