Pascal's Triangle II Problem

Pascal's Triangle II Problem — ExecCode Easy DSA Practice

Solve the Pascal's Triangle II problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an integer rowIndex, return the rowIndex^th (0-indexed) row of the Pascal's triangle. Your task is to in Pascal's triangle, each number is the sum of the two numbers directly above it as shown:. Return the required answer exactly as shown in the examples.

Examples

Input {"rowIndex": 3}; Output [1, 3, 3, 1]. Input {"rowIndex": 0}; Output [1]

Constraints

0 <= rowIndex <= 33

Practice Pascal's Triangle II free on ExecCode. Browse DSA problems, topic map, and placement guides.