Available question text
Return the 0-indexed rowIndex row of Pascal's triangle (i.e., the binomial coefficients C(rowIndex, k) for k=0..rowIndex). The core challenge is computing those coefficients efficiently, optionally using only O(rowIndex) extra space (e.g., in-place iterative or multiplicative methods).
Related questions
Continue with questions that share topics or the same question type.
- Pascal's Triangle
Coding · Array · Dynamic Programming
- Angles of a Triangle
Coding
- Color the Triangle Red
Coding
- Find Maximum Area of a Triangle
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 119. Pascal's Triangle II
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source