diff --git a/content/posts/2020-07-16-generic-flyweight-cpp/index.md b/content/posts/2020-07-16-generic-flyweight-cpp/index.md
index 3ca1e3a..303b3db 100644
--- a/content/posts/2020-07-16-generic-flyweight-cpp/index.md
+++ b/content/posts/2020-07-16-generic-flyweight-cpp/index.md
@@ -16,7 +16,7 @@ favorite: false
 The flyweight is a well-known
 [GoF](https://en.wikipedia.org/wiki/Design_Patterns) design pattern.
 
-Its intent is to minimize memory usage by reducing the number of instantiations
+It's intent is to minimize memory usage by reducing the number of instantiations
 of a given object.
 
 I will show you how to implement a robust flyweight in C++, as well as a way to
diff --git a/content/posts/2020-07-22-polymorphic-flyweight-cpp/index.md b/content/posts/2020-07-22-polymorphic-flyweight-cpp/index.md
index 2311002..5ff4b1f 100644
--- a/content/posts/2020-07-22-polymorphic-flyweight-cpp/index.md
+++ b/content/posts/2020-07-22-polymorphic-flyweight-cpp/index.md
@@ -68,7 +68,7 @@ public:
         const std::type_index lhs_i(lhs);
         const std::type_index rhs_i(rhs);
         if (lhs_i != rhs_i)
-            return lhs_i < rhs_i;
+            returh lhs_i < rhs_i;
         // We are now assured that both classes have the same type
         return less_than(rhs);
     }
diff --git a/content/posts/2024-06-24-union-find/index.md b/content/posts/2024-06-24-union-find/index.md
index fbfde55..e358205 100644
--- a/content/posts/2024-06-24-union-find/index.md
+++ b/content/posts/2024-06-24-union-find/index.md
@@ -94,7 +94,7 @@ def find(self, elem: int) -> int:
 
 However, going back up the chain of parents each time we want to find the root
 node (an `O(n)` operation) would make for disastrous performance. Instead we can
-do a small optimization called _path splitting_.
+do a small optimization called _path splitting.
 
 ```python
 def find(self, elem: int) -> int: