Pascal Triangle Row Output

MediumPython

Problem

Print out the nth row of Pascal's triangle.

Use zero-based indexing, so row 0 is [1]. Implement def pascal_row(n):, which accepts a non-negative integer and returns the row as a list of integers. Aim for O(n) auxiliary computation beyond the returned output, and do not construct the preceding rows.

Input and Output

The input is an integer n. Return a list containing the values in row n, from left to right.

Constraints

0 <= n <= 1000
Return exactly n + 1 integers
Use zero-based row indexing
All returned values fit within Python's arbitrary-precision integers

Function Signature

def pascal_row(n):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.