/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 views1 answer
Tkinter remove frame
Python
0 vote111 views3 answers
OpenCV(3.4.11) Error: Assertion failed (_img.rows * _img.cols == vecSize) in CvCascadeImageReader::PosReader::get
Python
0 vote92 views1 answer
How to read a data file in python and build a list of files
Python
0 vote132 views1 answer
Flask get uploaded file size
Python Flask
0 vote97 views1 answer
Python list fill nan
Python
0 vote103 views1 answer
Python svg viewing
Python
4 votes96 views1 answer
7chats_np
Python
0 vote104 views1 answer
Dictionary convert 2 lists into a dictionary, use zip()
Python
0 vote93 views1 answer
Use a library in python
Python
82 votes98 views4 answers
Python object to json file
Python