Mark As Completed Discussion

Good evening! Here's our prompt for today.

In a certain kind of pyramid, each number in a row is the sum of the two numbers directly above it (arranged in a triangular fashion).

Question

Given an integer n, return the first of the n rows of the pyramid.

For example, if n = 5, then the first 5 rows of the pyramid will be represented in the array form as follows,

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

Constraints

  • 1 <= n <= 30

Try to solve this here or in Interactive Mode.

How do I practice this challenge?

JAVASCRIPT
OUTPUT
:001 > Cmd/Ctrl-Enter to run, Cmd/Ctrl-/ to comment

Here's how we would solve this problem...

How do I use this guide?

Access all course materials today

The rest of this tutorial's contents are only available for premium members. Please explore your options at the link below.

Returning members can login to stop seeing this.