Add solution #119

Author: JoshCrozier

README.md

@@ -37,6 +37,7 @@
 73|[Set Matrix Zeroes](./0073-set-matrix-zeroes.js)|Medium|
 88|[Merge Sorted Array](./0088-merge-sorted-array.js)|Easy|
 118|[Pascal's Triangle](./0118-pascals-triangle.js)|Easy|
+119|[Pascal's Triangle II](./0119-pascals-triangle-ii.js)|Easy|
 121|[Best Time to Buy and Sell Stock](./0121-best-time-to-buy-and-sell-stock.js)|Easy|
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
 152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|

solutions/0119-pascals-triangle-ii.js

@@ -0,0 +1,32 @@
+/**
+ * 119. Pascal's Triangle II
+ * https://leetcode.com/problems/pascals-triangle-ii/
+ * Difficulty: Easy
+ *
+ * Given an integer rowIndex, return the rowIndexth (0-indexed) row of
+ * the Pascal's triangle.
+ *
+ * In Pascal's triangle, each number is the sum of the two numbers
+ * directly above it as shown:
+ */
+
+/**
+ * @param {number} rowIndex
+ * @return {number[]}
+ */
+var getRow = function(rowIndex) {
+  return generateTriangle(rowIndex + 1)[rowIndex];
+};
+
+function generateTriangle(numRows) {
+  const result = [[1]];
+
+  for (let i = 1; i < numRows; i++) {
+    result[i] = [1];
+    result[i - 1].forEach((value, j, prev) => {
+      result[i][j + 1] = (prev[j + 1] + value) || 1;
+    });
+  }
+
+  return result;
+};