# Problem Statement Given an integer `numRows`, return the first numRows of **Pascal's triangle**. ## Constraints - `1 <= numRows <= 30` # Solution Because any number in Pascal's Triangle is the [[N choose K|binomial coefficient]] ($n$ choose $k$), where $n$ is the row and $k$ is the column, we can solve this problem by calculating these values directly. ```python triangle = [] for i in range(numRows): row = [] for j in range(i+1): row.append(comb(i,j)) triangle.append(row) return triangle ``` Time Complexity: O$(n^2)$ | Space Complexity: O$(n^2)$