From b64089465312636f61175d881496e75b04c9344b Mon Sep 17 00:00:00 2001
From: Barrett Ruth <br.barrettruth@gmail.com>
Date: Fri, 30 May 2025 20:14:47 -0500
Subject: [PATCH] feat: fix headers

---
 .../posts/algorithms/extrema-circular-buffer.mdx     | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/src/content/posts/algorithms/extrema-circular-buffer.mdx b/src/content/posts/algorithms/extrema-circular-buffer.mdx
index 0bc2878..bc0f8cd 100644
--- a/src/content/posts/algorithms/extrema-circular-buffer.mdx
+++ b/src/content/posts/algorithms/extrema-circular-buffer.mdx
@@ -4,7 +4,7 @@ date: "30/07/2024"
 useKatex: true
 ---
 
-## context
+# context
 
 While working for [TRB Capital Management](https://trbcap.com/), certain strategies necessitated finding the minimum and maximum of a moving window of prices.
 
@@ -19,11 +19,11 @@ Design a data structure supporting the following operations:
 - `size_t size()` : return the number of prices in the data structure
 - `double get()` : return the extrema (min or max)
 
-## solution
+# solution
 
 Try to solve it yourself first. The point of this exercise it to create the most theoretically optimal solution you can, not brute-force and move on.
 
-### naïve solution
+## naïve solution
 
 One can design a data structure meeting these requirements through simulating the operations directly with a [`std::deque<double>`](https://en.cppreference.com/w/cpp/container/deque).
 
@@ -70,7 +70,7 @@ private:
 };
 ```
 
-### optimizing the approach
+# optimizing the approach
 
 Rather than bear the brunt of the work finding extrema in calls to `get()`, we can distribute it across the data structure as it is built.
 
@@ -134,7 +134,7 @@ public:
 };
 ```
 
-### monotonic queues deques
+## monotonic ~~queues~~ deques
 
 Thinking a bit deeper about the problem constraints, it is clear that:
 
@@ -215,7 +215,7 @@ private:
 };
 ```
 
-### further improvements
+## further improvements
 
 The final implementation utilized in the TRB includes the following features: