diff --git a/src/content/algorithms/leetcode-daily.mdx b/src/content/algorithms/leetcode-daily.mdx
index 513a7cb..565cfe5 100644
--- a/src/content/algorithms/leetcode-daily.mdx
+++ b/src/content/algorithms/leetcode-daily.mdx
@@ -5,7 +5,7 @@ useKatex: true
 showToc: true
 ---
 
-# [count good numbers](https://leetcode.com/problems/count-good-numbers)
+# [count good numbers](https://leetcode.com/problems/count-good-numbers) <span class="date">13/12/2024</span>
 
 ## understanding the problem
 
@@ -39,7 +39,7 @@ public:
 };
 ```
 
-# [minimum number of operations to make array distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct)
+# [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
 
@@ -56,7 +56,7 @@ The solution is optimal, considering the least amount of elements possible in:
 - <u>Time Complexity</u>: $O(n)$
 - <u>Space Complexity</u>: $\Theta(1)$
 
-# [count the number of fair pairs](https://leetcode.com/problems/count-the-number-of-fair-pairs/)
+# [count the number of fair pairs](https://leetcode.com/problems/count-the-number-of-fair-pairs/) <span class="date">10/12/2024</span>
 
 ## problem statement
 
@@ -146,7 +146,7 @@ The second approach is _asymptotically_ equivalent. However, it's still worth co
   respect to the second approach.
 - <u>Space Complexity</u>: $\Theta(1)$ for both.
 
-# [most beautiful item for each query](https://leetcode.com/problems/most-beautiful-item-for-each-query/description/)
+# [most beautiful item for each query](https://leetcode.com/problems/most-beautiful-item-for-each-query/description/) <span class="date">09/12/2024</span>
 
 ## problem statement
 
@@ -213,7 +213,7 @@ Let `n=len(items)` and `m=len(queries)`. There may be more items than queries, o
   allocated. If `queries`/`items` cannot be modified in-place, increase the
   space complexity by $m$/$n$ respectively.
 
-# [shortest subarray with or at least k ii](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/description/)
+# [shortest subarray with or at least k ii](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/description/) <span class="date">09/11/2024</span>
 
 ## problem statement
 
@@ -286,7 +286,7 @@ Note that the size of the frequency map is bounded by $lg_{2}({10^9})\approx30$.
   considered at least once and takes $O(1)$ work each to find the element-wise
   bitwise OR.
 
-# [minimum array end](https://leetcode.com/problems/minimum-array-end/)
+# [minimum array end](https://leetcode.com/problems/minimum-array-end/) <span class="date">09/10/2024</span>
 
 ## problem statement
 
diff --git a/src/content/meditations/suck-less-or-suck-more.mdx b/src/content/meditations/suck-less-or-suck-more.mdx
index 4ca0c15..7fb7df6 100644
--- a/src/content/meditations/suck-less-or-suck-more.mdx
+++ b/src/content/meditations/suck-less-or-suck-more.mdx
@@ -15,7 +15,7 @@ Maybe this is the point. But I can't avoid [foxglove](https://wiki.ros.org/Foxgl
 
 I've switched to [spectrwm](https://github.com/conformal/spectrwm) (essentially [this](https://github.com/conformal/spectrwm)) and [ghostty](https://ghostty.org/).
 
-# update: goodbye xorg
+# update: goodbye xorg <span class="date">09/10/2025</span>
 
 I am now sick of Xorg and their lack of per-monitor DPI scaling. The new stack is:
 
diff --git a/src/content/software/designing-this-website.mdx b/src/content/software/designing-this-website.mdx
index 213dce4..e3b8698 100644
--- a/src/content/software/designing-this-website.mdx
+++ b/src/content/software/designing-this-website.mdx
@@ -3,7 +3,7 @@ title: "designing this website"
 date: "18/06/2024"
 ---
 
-## update: port to astro
+## update: port to astro <span class="date">22/05/2025</span>
 
 I'm expanding my website to include more detailed algorithms, implementations, write-ups, and low-level optimization case studies.
 
@@ -55,7 +55,7 @@ Building this website with truly bare-bones technologies has made me appreciate
 - Reusing HTML, styles, and JavaScript feels extremely fragile. Innovative type-safe, optimized, and composable solutions definitely have their place in the web.
 - **You can be efficient with HTML, JS, and CSS.** My iteration speed on on this site versus other React.js/MDX blogs I have worked on is the same if not faster. While this may be a testament to my lack of JavaScript experience, I think people conclude too early that their task is beyond the technologies that form the foundation of the web today.
 
-## the setup
+## the setup <span class="date">15/06/2024</span>
 
 This website is pure HTML, CSS, and JavaScript.