Pascal's Triangle Problem

Pascal's Triangle Problem — ExecCode Easy DSA Practice

Solve the Pascal's Triangle 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 numRows, return the first numRows of 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 {"numRows": 5}; Output [[1], [1, 1], [1, 2, 1], [1, 3, 3, 1], [1, 4, 6, 4, 1]]. Input {"numRows": 1}; Output [[1]]

Constraints

1 <= numRows <= 30

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