# Pascal’s Triangle II Leetcode Solution

In this post, we are going to solve the Pascal’s Triangle II Leetcode Solution problem of Leetcode. This Leetcode problem is done in many programming languages like C++, Java, and Python.

## Problem

Given an integer `rowIndex`, return the `rowIndexth` (0-indexed) row of the Pascal’s triangle.

In Pascal’s triangle, each number is the sum of the two numbers directly above it as shown:

Example 1:

```Input: rowIndex = 3
Output: [1,3,3,1]
```

Example 2:

```Input: rowIndex = 0
Output: 
```

Example 3:

```Input: rowIndex = 1
Output: [1,1]
```

Constraints:

• `0 <= rowIndex <= 33`

Follow up: Could you optimize your algorithm to use only `O(rowIndex)` extra space?

Now, lets see the leetcode solution of Pascal’s Triangle II Leetcode Solution.

### Pascal’s Triangle II Leetcode Solution in Java

Note: This problem Pascal’s Triangle II is generated by Leetcode but the solution is provided by Chase2learn This tutorial is only for Educational and Learning purpose.

Sharing Is Caring