/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

26 votes112 views1 answer
Dictionary from two lists
Python
0 vote152 views1 answer
Https://practice.geeksforgeeks.org/problems/coin-change2448/1
Python
0 vote149 views2 answers
Requests get cookies from response
Python
0 vote168 views1 answer
How to remove explicit string concatenation
Python
22 votes151 views6 answers
How to merge two dataframes
Python
11 votes130 views2 answers
How to send whatsapp message with python
Python
2 votes117 views1 answer
Confidence intervals in python
Python
0 vote81 views1 answer
Dip programming language
Python
0 vote110 views1 answer
Regex to find ip address python
Python
1 vote146 views1 answer
For idx, col_name in enumerate(X_train.columns): print("The coefficient for {} is {}".format(file_name, regression_model.coef_[0][idx]))
Python