diff --git a/src/components/Footer.astro b/src/components/Footer.astro
index 9f5012c..246edb2 100644
--- a/src/components/Footer.astro
+++ b/src/components/Footer.astro
@@ -38,4 +38,4 @@
}
-
+
diff --git a/src/components/Header.astro b/src/components/Header.astro
index e039e7e..8d9b177 100644
--- a/src/components/Header.astro
+++ b/src/components/Header.astro
@@ -40,4 +40,4 @@ const promptText = topic ? `barrett@ruth:~$ ${topic}` : "barrett@ruth:~$";
}
-
+
diff --git a/src/content/algorithms/leetcode-daily.mdx b/src/content/algorithms/leetcode-daily.mdx
index 7a53620..e22afc9 100644
--- a/src/content/algorithms/leetcode-daily.mdx
+++ b/src/content/algorithms/leetcode-daily.mdx
@@ -103,7 +103,7 @@ def countFairPairs(self, nums, lower, upper):
## optimizing the approach
-If we interpret the criteria this way, the above approach is relatively efficient. To improve this approach, we'll need to reinterpret the constraints. Forget about the indexing and consider the constraint in aggregate. We want to find all $i,j$ with $x=nums$i$+nums$j$$ such that $i\neq j,lower\leq x\leq upper$.
+If we interpret the criteria this way, the above approach is relatively efficient. To improve this approach, we'll need to reinterpret the constraints. Forget about the indexing and consider the constraint in aggregate. We want to find all $i,j$ with $x=nums[i]+nums[j]$ such that $i\neq j,lower\leq x\leq upper$.
We _still_ need to reduce the “dimensionality” of the problem—there are just too many moving parts to consider at once. This seems challening. Let's simplify the problem to identify helpful ideas: pretend `lower` does not exist (and, of course, that `nums` is sorted).
diff --git a/src/layouts/GitLayout.astro b/src/layouts/GitLayout.astro
index df2baa2..411560f 100644
--- a/src/layouts/GitLayout.astro
+++ b/src/layouts/GitLayout.astro
@@ -10,7 +10,7 @@ const { frontmatter } = Astro.props;