Problem
Solution
Submissions
Generate Pascal's Triangle Up to N Rows
Certification: Basic Level
Accuracy: 47.06%
Submissions: 102
Points: 10
Write a Python program that generates Pascal's Triangle up to N rows.
Example 1
- Input: N = 5
- Output:
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1] - Explanation:
- Step 1: Start with the first row as [1].
- Step 2: To generate the next row, add adjacent elements of the previous row.
- Step 3: Each row starts and ends with 1.
- Step 4: Continue this process until we have N rows.
Example 2
- Input: N = 3
- Output:
[1]
[1, 1]
[1, 2, 1] - Explanation:
- Step 1: Start with the first row as [1].
- Step 2: Generate the second row as [1, 1].
- Step 3: Generate the third row by adding adjacent elements of the second row: [1, 1+1, 1] = [1, 2, 1].
Constraints
- 0 ≤ N ≤ 30
- Time Complexity: O(n²)
- Space Complexity: O(n²)
Editorial
My Submissions
All Solutions
| Lang | Status | Date | Code |
|---|---|---|---|
| You do not have any submissions for this problem. | |||
| User | Lang | Status | Date | Code |
|---|---|---|---|---|
| No submissions found. | ||||
Solution Hints
- Start with the first row as [1]
- Each row can be built using: row[i] = prev_row[i-1] + prev_row[i] for middle elements