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