/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

1 vote100 views2 answers
Python write request must be str not bytes
Python
0 vote106 views1 answer
Add a constant to a list python
Python
0 vote101 views1 answer
Apply strip() a column in pandas
Python
0 vote90 views1 answer
Pandas df filter by time hour
Python
0 vote115 views4 answers
Python convert dict_keys to list
Python
6 votes108 views2 answers
How to get the current web page link in selenium pthon
Python
0 vote104 views1 answer
Python regex inside quotes
Python
4 votes108 views2 answers
__call__ python
Python
1 vote107 views1 answer
Change text color docx-python
Python
3 votes116 views2 answers
Module 'cv2' has no 'imread' member
Python