/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

2 votes213 views1 answer
Get length of csv file with python
Python
0 vote180 views1 answer
Kinesis Client get_records response json
Python
0 vote247 views1 answer
Remove hh:mm:ss from pandas dataframe column
Python
0 vote246 views1 answer
Check for prime in python
Python
0 vote221 views1 answer
Divide every element in numpy array
Python
2 votes203 views1 answer
Python assign list item in for loop
Python
2 votes183 views1 answer
Python check if string is in input
Python
1 vote205 views1 answer
Django reverse queryset
Python
10 votes174 views4 answers
Calculate age python
Python
0 vote187 views1 answer
Dfs and bfs inn python
Python