Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 101

Pascal's Triangle

EasyRecursion & Call Stack

Return the first numRows rows of Pascal's triangle. Each interior value is the sum of the two values above it — trust the previous row.

Examples

Example 1

Input: numRows = 5

Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]

Constraints

1 ≤ numRows ≤ 30

Target ComplexityNot required

O(n) Time · O(n) Space

Companies (4)

AmazonAppleGoogleAdobe

Node 22.08.0

Loading editor…

Test casesRun to compare output

InputnumRows = 5

Expected[[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]

Output—