# Pascal’s Triangle

Given an integer `n`

, return the `nth`

(0-indexed) row of Pascal’s triangle.

Pascal’s triangle can be created as follows: In the top row, there is an array of 1. Each subsequent row is created by adding the number above and to the left with the number above and to the right, treating empty elements as `0`

.

The first few rows are:

https://binarysearch.com/problems/Pascal’s-Triangle

## Examples

### Example 1

**Input**

- n =
`3`

**Output**

- answer =
`[1, 3, 3, 1]`

**Explanation**

This is row `3`

in

```
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
```

## Leave a comment