Given a positive integer N, return the N^th row of pascal's triangle.
Pascal's triangle is a triangular array of the binomial coefficients formed by summing up the elements of previous row.

Example :
1
1 1
1 2 1
1 3 3 1
For N = 3, return 3rd row i.e 1 2 1

Example 1:

Input:
N = 4
Output: 1 3 3 1
Explanation: 4^th row of pascal's triangle
is 1 3 3 1.

Example 2:

Input:
N = 5
Output: 1 4 6 4 1
Explanation: 5^th row of pascal's triangle
is 1 4 6 4 1.

Your Task:
Complete the function nthRowOfPascalTriangle() which takes n, as input parameters and returns an array representing the answer. The elements can be large so return it modulo 10⁹ + 7. You don't to print answer or take inputs.

Expected Time Complexity: O(N²)
Expected Auxiliary Space: O(N²)

Constraints:
1 ≤ N ≤ 1000