Leetcode 119. Pascal's Triangle II

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 119. Pascal's Triangle II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact