Nth row of Pascal Triangle
Detailed guide and Python implementation for the 'Nth row of Pascal Triangle' problem.
Problem Statement
Write a function pascal_row(n) that returns the nth row of Pascal's Triangle as a list of integers using recursion. Rows are 0-indexed: row 0 is [1], row 1 is [1, 1], row 2 is [1, 2, 1], etc. Each element is the sum of the two elements directly above it in the previous row.
- •0 <= n <= 30
Examples
n = 0
[1]
The 0th row of Pascal's Triangle is just [1].
n = 4
[1, 4, 6, 4, 1]
Row 3 is [1,3,3,1]. Row 4: 1, (1+3)=4, (3+3)=6, (3+1)=4, 1.
n = 2
[1, 2, 1]
Row 1 is [1,1]. Row 2: 1, (1+1)=2, 1.
Need a Hint?
Edge Cases to Watch
- Empty input structures
- Single element inputs
- Large numerical bounds
Ready to Solve?
Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.
Recommended Python Resources
Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.
Python Loops
Learn how to use Python loops to iterate over data. Master for loops, while loops, break, continue, and loop best practices with interactive examples.
How to Find the Length of a List in Python
Learn how to find the length of a list in Python using the len() function. Understand the O(1) time complexity and checking counts.
Python String Methods
A complete reference guide for Python string manipulation. Master formatting, searching, splitting, replacing, and checking string properties.
Python vs JavaScript: Which Programming Language is Best?
A comprehensive comparison between Python and JavaScript. Explore syntax differences, performance, use cases (backend vs frontend), and coding examples.