Pascal Triangle Row Output | Dataford Interview Questions

Print out the nth row of Pascal's triangle.

Use zero-based indexing, so row 0 is [1]. Implement 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):

Your question is Pascal Triangle Row Output. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem