diff --git a/src/content/algorithms/leetcode-daily.mdx b/src/content/algorithms/leetcode-daily.mdx
index c31fad5..7a53620 100644
--- a/src/content/algorithms/leetcode-daily.mdx
+++ b/src/content/algorithms/leetcode-daily.mdx
@@ -38,7 +38,7 @@ public:
 };
 ```
 
-# [minimum number of operations to make array distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinc) <span class="date">04/10/2024</span>
+# [minimum number of operations to make array distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct) <span class="date">04/10/2024</span>
 
 ## understanding the problem
 
diff --git a/src/content/algorithms/models-of-production.mdx b/src/content/algorithms/models-of-production.mdx
index f8b568e..5552192 100644
--- a/src/content/algorithms/models-of-production.mdx
+++ b/src/content/algorithms/models-of-production.mdx
@@ -164,7 +164,7 @@ The Model divides the world into two parts:
 - <u>Objects</u>: finite resources, like capital and labor in the Solow Model
 - <u>Ideas</u>: infinite,
   [non-rivalrous](https://en.wikipedia.org/wiki/Rivalry_(economics)) items
-  leveraged in production (note that ideas may be [excludable](blank), though)
+  leveraged in production (note that ideas may be excludable, though)
 
 The Romer Models' production function can be modelled as:
 
diff --git a/src/content/git/cp.nvim.mdx b/src/content/git/cp.nvim.mdx
index 4e32c61..b151651 100644
--- a/src/content/git/cp.nvim.mdx
+++ b/src/content/git/cp.nvim.mdx
@@ -6,7 +6,7 @@ date: "10/10/2025"
 
 [Source code](https://github.com/barrett-ruth/cp.nvim)
 
-Things have changed since I last documented my competitive programming setup [here](https://barrettruth.com/posts/software/my-cp-setup.html).
+Things have changed since I last documented my competitive programming setup [here](/software/my-cp-setup.html).
 
 # my goals
 
diff --git a/src/content/meditations/the-problem-with-cs-curricula.mdx b/src/content/meditations/the-problem-with-cs-curricula.mdx
index 2380ed6..e2414c4 100644
--- a/src/content/meditations/the-problem-with-cs-curricula.mdx
+++ b/src/content/meditations/the-problem-with-cs-curricula.mdx
@@ -17,6 +17,6 @@ Walking out of my third year, I left with the sad realization that I got by the
 
 I always knew something was wrong with how my school taught computer science (despite it being the biggest major as of 2025). As of late, though, I realized the gargantuan amount of damage it caused to my reasoning abilities. Damage that I have to reverse by, essentially, doing everything all over again.
 
-My [competitive programming journey](https://barrettruth.com/algorithms/competitive-programming-log.html) epitomizes this point: to this day I struggle with reasoning, argumentation, and understanding program behavior. I know how a segment tree works but can't formalize the constraints of a problem. I can do dynamic programming on trees but I can barely manipulate and work with primitive mathematical concepts such as the $gcd$ function. I cannot think of a more useless skillset.
+My [competitive programming journey](/algorithms/competitive-programming-log.html) epitomizes this point: to this day I struggle with reasoning, argumentation, and understanding program behavior. I know how a segment tree works but can't formalize the constraints of a problem. I can do dynamic programming on trees but I can barely manipulate and work with primitive mathematical concepts such as the $gcd$ function. I cannot think of a more useless skillset.
 
 Nearly all of this is my fault. However, _it should not be possible for this to happen in a computer science curriculum_. In other words, Djikstra is right.