diff --git a/content/posts/2024-06-24-union-find/index.md b/content/posts/2024-06-24-union-find/index.md
index e358205..27dcc72 100644
--- a/content/posts/2024-06-24-union-find/index.md
+++ b/content/posts/2024-06-24-union-find/index.md
@@ -10,18 +10,18 @@ tags:
 categories:
   - programming
 series:
-  - Cool algorithms
+  - Lesser known algorithms and data structures
 favorite: false
 disable_feed: false
 ---
 
-To kickoff the [series]({{< ref "/series/cool-algorithms/">}}) of posts about
-algorithms and data structures I find interesting, I will be talking about my
-favorite one: the [_Disjoint Set_][wiki]. Also known as the _Union-Find_ data
-structure, so named because of its two main operations: `ds.union(lhs, rhs)` and
-`ds.find(elem)`.
+To kickoff the [series] of posts about criminally underrated algorithms and data
+structures, I will be talking about my favorite one: the [_Disjoint Set_][wiki].
+Also known as the _Union-Find_ data structure, so named because of its two main
+operations: `ds.union(lhs, rhs)` and `ds.find(elem)`.
 
 [wiki]: https://en.wikipedia.org/wiki/Disjoint-set_data_structure
+[series]: {{< ref "/series/lesser-known-algorithms-and-data-structures/">}}
 
 <!--more-->