Aug 01

Author: siddydutta

2025-08-August-LeetCoding-Challenge/Pascal's Triangle.py

@@ -0,0 +1,24 @@
+class Solution:
+    def generate(self, numRows: int) -> list[list[int]]:
+        triangle = [[1]]
+        for i in range(1, numRows):
+            row = [1]
+            for j in range(1, i):
+                row.append(triangle[i - 1][j - 1] + triangle[i - 1][j])
+            row.append(1)
+            triangle.append(row)
+        return triangle
+
+
+def main():
+    assert Solution().generate(5) == [[1],
+                                      [1, 1],
+                                      [1, 2, 1],
+                                      [1, 3, 3, 1],
+                                      [1, 4, 6, 4, 1]]
+
+    assert Solution().generate(1) == [[1]]
+
+
+if __name__ == '__main__':
+    main()

2025-08-August-LeetCoding-Challenge/README.md

@@ -4,7 +4,7 @@
 ## Questions
 | Day | Problem | Level | Status |
 | --- | --- | --- | --- |
-| August 01 | []() |  |  |
+| August 01 | [118. Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | Easy | Solved |
 | August 02 | []() |  |  |
 | August 03 | []() |  |  |
 | August 04 | []() |  |  |
@@ -40,6 +40,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 0 | 0 | 0 |
+| Easy   | 1 | 1 | 0 |
 | Medium | 0 | 0 | 0 |
 | Hard   | 0 | 0 | 0 |