diff --git a/config.json b/config.json
index 530fc815..e90ba28a 100644
--- a/config.json
+++ b/config.json
@@ -106,6 +106,14 @@
         ],
         "difficulty": 1
       },
+      {
+        "slug": "pascals-triangle",
+        "name": "Pascal's Triangle",
+        "uuid": "91ffec02-b596-4a56-bbe1-59d1dd26fd76",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 4
+      },
       {
         "slug": "rotational-cipher",
         "name": "Rotational Cipher",
diff --git a/exercises/practice/pascals-triangle/.docs/instructions.md b/exercises/practice/pascals-triangle/.docs/instructions.md
new file mode 100644
index 00000000..0f58f006
--- /dev/null
+++ b/exercises/practice/pascals-triangle/.docs/instructions.md
@@ -0,0 +1,35 @@
+# Instructions
+
+Your task is to output the first N rows of Pascal's triangle.
+
+[Pascal's triangle][wikipedia] is a triangular array of positive integers.
+
+In Pascal's triangle, the number of values in a row is equal to its row number (which starts at one).
+Therefore, the first row has one value, the second row has two values, and so on.
+
+The first (topmost) row has a single value: `1`.
+Subsequent rows' values are computed by adding the numbers directly to the right and left of the current position in the previous row.
+
+If the previous row does _not_ have a value to the left or right of the current position (which only happens for the leftmost and rightmost positions), treat that position's value as zero (effectively "ignoring" it in the summation).
+
+## Example
+
+Let's look at the first 5 rows of Pascal's Triangle:
+
+```text
+    1
+   1 1
+  1 2 1
+ 1 3 3 1
+1 4 6 4 1
+```
+
+The topmost row has one value, which is `1`.
+
+The leftmost and rightmost values have only one preceding position to consider, which is the position to its right respectively to its left.
+With the topmost value being `1`, it follows from this that all the leftmost and rightmost values are also `1`.
+
+The other values all have two positions to consider.
+For example, the fifth row's (`1 4 6 4 1`) middle value is `6`, as the values to its left and right in the preceding row are `3` and `3`:
+
+[wikipedia]: https://en.wikipedia.org/wiki/Pascal%27s_triangle
diff --git a/exercises/practice/pascals-triangle/.docs/introduction.md b/exercises/practice/pascals-triangle/.docs/introduction.md
new file mode 100644
index 00000000..eab454e5
--- /dev/null
+++ b/exercises/practice/pascals-triangle/.docs/introduction.md
@@ -0,0 +1,22 @@
+# Introduction
+
+With the weather being great, you're not looking forward to spending an hour in a classroom.
+Annoyed, you enter the class room, where you notice a strangely satisfying triangle shape on the blackboard.
+Whilst waiting for your math teacher to arrive, you can't help but notice some patterns in the triangle: the outer values are all ones, each subsequent row has one more value than its previous row and the triangle is symmetrical.
+Weird!
+
+Not long after you sit down, your teacher enters the room and explains that this triangle is the famous [Pascal's triangle][wikipedia].
+
+Over the next hour, your teacher reveals some amazing things hidden in this triangle:
+
+- It can be used to compute how many ways you can pick K elements from N values.
+- It contains the Fibonacci sequence.
+- If you color odd and even numbers differently, you get a beautiful pattern called the [Sierpiński triangle][wikipedia-sierpinski-triangle].
+
+The teacher implores you and your classmates to look up other uses, and assures you that there are lots more!
+At that moment, the school bell rings.
+You realize that for the past hour, you were completely absorbed in learning about Pascal's triangle.
+You quickly grab your laptop from your bag and go outside, ready to enjoy both the sunshine _and_ the wonders of Pascal's triangle.
+
+[wikipedia]: https://en.wikipedia.org/wiki/Pascal%27s_triangle
+[wikipedia-sierpinski-triangle]: https://en.wikipedia.org/wiki/Sierpi%C5%84ski_triangle
diff --git a/exercises/practice/pascals-triangle/.meta/config.json b/exercises/practice/pascals-triangle/.meta/config.json
new file mode 100644
index 00000000..e54fd33e
--- /dev/null
+++ b/exercises/practice/pascals-triangle/.meta/config.json
@@ -0,0 +1,19 @@
+{
+  "authors": [
+    "keiravillekode"
+  ],
+  "files": {
+    "solution": [
+      "pascals_triangle.zig"
+    ],
+    "test": [
+      "test_pascals_triangle.zig"
+    ],
+    "example": [
+      ".meta/example.zig"
+    ]
+  },
+  "blurb": "Compute Pascal's triangle up to a given number of rows.",
+  "source": "Pascal's Triangle at Wolfram Math World",
+  "source_url": "https://www.wolframalpha.com/input/?i=Pascal%27s+triangle"
+}
diff --git a/exercises/practice/pascals-triangle/.meta/example.zig b/exercises/practice/pascals-triangle/.meta/example.zig
new file mode 100644
index 00000000..80327467
--- /dev/null
+++ b/exercises/practice/pascals-triangle/.meta/example.zig
@@ -0,0 +1,18 @@
+const std = @import("std");
+const mem = std.mem;
+
+pub fn rows(allocator: mem.Allocator, count: usize) mem.Allocator.Error![][]u128 {
+    var result = try allocator.alloc([]u128, count);
+    for (0..count) |i| {
+        result[i] = try allocator.alloc(u128, i + 1);
+        result[i][0] = 1;
+        result[i][i] = 1;
+        if (i == 0) {
+            continue;
+        }
+        for (1..i) |j| {
+            result[i][j] = result[i - 1][j - 1] + result[i - 1][j];
+        }
+    }
+    return result;
+}
diff --git a/exercises/practice/pascals-triangle/.meta/tests.toml b/exercises/practice/pascals-triangle/.meta/tests.toml
new file mode 100644
index 00000000..2db0ee52
--- /dev/null
+++ b/exercises/practice/pascals-triangle/.meta/tests.toml
@@ -0,0 +1,34 @@
+# This is an auto-generated file.
+#
+# Regenerating this file via `configlet sync` will:
+# - Recreate every `description` key/value pair
+# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications
+# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion)
+# - Preserve any other key/value pair
+#
+# As user-added comments (using the # character) will be removed when this file
+# is regenerated, comments can be added via a `comment` key.
+
+[9920ce55-9629-46d5-85d6-4201f4a4234d]
+description = "zero rows"
+
+[70d643ce-a46d-4e93-af58-12d88dd01f21]
+description = "single row"
+
+[a6e5a2a2-fc9a-4b47-9f4f-ed9ad9fbe4bd]
+description = "two rows"
+
+[97206a99-79ba-4b04-b1c5-3c0fa1e16925]
+description = "three rows"
+
+[565a0431-c797-417c-a2c8-2935e01ce306]
+description = "four rows"
+
+[06f9ea50-9f51-4eb2-b9a9-c00975686c27]
+description = "five rows"
+
+[c3912965-ddb4-46a9-848e-3363e6b00b13]
+description = "six rows"
+
+[6cb26c66-7b57-4161-962c-81ec8c99f16b]
+description = "ten rows"
diff --git a/exercises/practice/pascals-triangle/pascals_triangle.zig b/exercises/practice/pascals-triangle/pascals_triangle.zig
new file mode 100644
index 00000000..bfb8608e
--- /dev/null
+++ b/exercises/practice/pascals-triangle/pascals_triangle.zig
@@ -0,0 +1,8 @@
+const std = @import("std");
+const mem = std.mem;
+
+pub fn rows(allocator: mem.Allocator, count: usize) mem.Allocator.Error![][]u128 {
+    _ = allocator;
+    _ = count;
+    @compileError("please implement the rows function");
+}
diff --git a/exercises/practice/pascals-triangle/test_pascals_triangle.zig b/exercises/practice/pascals-triangle/test_pascals_triangle.zig
new file mode 100644
index 00000000..0ac86b38
--- /dev/null
+++ b/exercises/practice/pascals-triangle/test_pascals_triangle.zig
@@ -0,0 +1,153 @@
+const std = @import("std");
+const testing = std.testing;
+
+const pascals_triangle = @import("pascals_triangle.zig");
+
+fn free(slices: [][]u128) void {
+    for (slices) |slice| {
+        testing.allocator.free(slice);
+    }
+    testing.allocator.free(slices);
+}
+
+test "zero rows" {
+    const expected = try testing.allocator.alloc([]const u128, 0);
+    defer testing.allocator.free(expected);
+
+    const actual = try pascals_triangle.rows(testing.allocator, 0);
+    defer free(actual);
+
+    try testing.expectEqual(expected.len, actual.len);
+    for (expected, actual) |expected_slice, actual_slice| {
+        try testing.expectEqualSlices(u128, expected_slice, actual_slice);
+    }
+}
+
+test "single row" {
+    var expected = try testing.allocator.alloc([]const u128, 1);
+    expected[0] = &.{1};
+    defer testing.allocator.free(expected);
+
+    const actual = try pascals_triangle.rows(testing.allocator, 1);
+    defer free(actual);
+
+    try testing.expectEqual(expected.len, actual.len);
+    for (expected, actual) |expected_slice, actual_slice| {
+        try testing.expectEqualSlices(u128, expected_slice, actual_slice);
+    }
+}
+
+test "two rows" {
+    var expected = try testing.allocator.alloc([]const u128, 2);
+    expected[0] = &.{1};
+    expected[1] = &.{ 1, 1 };
+    defer testing.allocator.free(expected);
+
+    const actual = try pascals_triangle.rows(testing.allocator, 2);
+    defer free(actual);
+
+    try testing.expectEqual(expected.len, actual.len);
+    for (expected, actual) |expected_slice, actual_slice| {
+        try testing.expectEqualSlices(u128, expected_slice, actual_slice);
+    }
+}
+
+test "three rows" {
+    var expected = try testing.allocator.alloc([]const u128, 3);
+    expected[0] = &.{1};
+    expected[1] = &.{ 1, 1 };
+    expected[2] = &.{ 1, 2, 1 };
+    defer testing.allocator.free(expected);
+
+    const actual = try pascals_triangle.rows(testing.allocator, 3);
+    defer free(actual);
+
+    try testing.expectEqual(expected.len, actual.len);
+    for (expected, actual) |expected_slice, actual_slice| {
+        try testing.expectEqualSlices(u128, expected_slice, actual_slice);
+    }
+}
+
+test "four rows" {
+    var expected = try testing.allocator.alloc([]const u128, 4);
+    expected[0] = &.{1};
+    expected[1] = &.{ 1, 1 };
+    expected[2] = &.{ 1, 2, 1 };
+    expected[3] = &.{ 1, 3, 3, 1 };
+    defer testing.allocator.free(expected);
+
+    const actual = try pascals_triangle.rows(testing.allocator, 4);
+    defer free(actual);
+
+    try testing.expectEqual(expected.len, actual.len);
+    for (expected, actual) |expected_slice, actual_slice| {
+        try testing.expectEqualSlices(u128, expected_slice, actual_slice);
+    }
+}
+
+test "five rows" {
+    var expected = try testing.allocator.alloc([]const u128, 5);
+    expected[0] = &.{1};
+    expected[1] = &.{ 1, 1 };
+    expected[2] = &.{ 1, 2, 1 };
+    expected[3] = &.{ 1, 3, 3, 1 };
+    expected[4] = &.{ 1, 4, 6, 4, 1 };
+    defer testing.allocator.free(expected);
+
+    const actual = try pascals_triangle.rows(testing.allocator, 5);
+    defer free(actual);
+
+    try testing.expectEqual(expected.len, actual.len);
+    for (expected, actual) |expected_slice, actual_slice| {
+        try testing.expectEqualSlices(u128, expected_slice, actual_slice);
+    }
+}
+
+test "six rows" {
+    var expected = try testing.allocator.alloc([]const u128, 6);
+    expected[0] = &.{1};
+    expected[1] = &.{ 1, 1 };
+    expected[2] = &.{ 1, 2, 1 };
+    expected[3] = &.{ 1, 3, 3, 1 };
+    expected[4] = &.{ 1, 4, 6, 4, 1 };
+    expected[5] = &.{ 1, 5, 10, 10, 5, 1 };
+    defer testing.allocator.free(expected);
+
+    const actual = try pascals_triangle.rows(testing.allocator, 6);
+    defer free(actual);
+
+    try testing.expectEqual(expected.len, actual.len);
+    for (expected, actual) |expected_slice, actual_slice| {
+        try testing.expectEqualSlices(u128, expected_slice, actual_slice);
+    }
+}
+
+test "ten rows" {
+    var expected = try testing.allocator.alloc([]const u128, 10);
+    expected[0] = &.{1};
+    expected[1] = &.{ 1, 1 };
+    expected[2] = &.{ 1, 2, 1 };
+    expected[3] = &.{ 1, 3, 3, 1 };
+    expected[4] = &.{ 1, 4, 6, 4, 1 };
+    expected[5] = &.{ 1, 5, 10, 10, 5, 1 };
+    expected[6] = &.{ 1, 6, 15, 20, 15, 6, 1 };
+    expected[7] = &.{ 1, 7, 21, 35, 35, 21, 7, 1 };
+    expected[8] = &.{ 1, 8, 28, 56, 70, 56, 28, 8, 1 };
+    expected[9] = &.{ 1, 9, 36, 84, 126, 126, 84, 36, 9, 1 };
+    defer testing.allocator.free(expected);
+
+    const actual = try pascals_triangle.rows(testing.allocator, 10);
+    defer free(actual);
+
+    try testing.expectEqual(expected.len, actual.len);
+    for (expected, actual) |expected_slice, actual_slice| {
+        try testing.expectEqualSlices(u128, expected_slice, actual_slice);
+    }
+}
+
+test "seventy-five rows" {
+    const actual = try pascals_triangle.rows(testing.allocator, 75);
+    defer free(actual);
+
+    try testing.expectEqual(17_46_130_564_335_626_209_832, actual[74][37]);
+}