feat: refactor + remove trading section

public/code/algorithms/extrema-circular-buffer/map.cpp

@@ -0,0 +1,51 @@
+#include <deque>
+#include <map>
+#include <stdexcept>
+
+class ExtremaCircularBuffer {
+public:
+  void push_back(double value) {
+    if (prices.size() == capacity) {
+      double front = prices.front();
+
+      if (--sorted_prices[front] == 0)
+        sorted_prices.erase(front);
+      prices.pop_front();
+    }
+
+    prices.push_back(value);
+    ++sorted_prices[value];
+  }
+
+  void pop_front() {
+    if (prices.empty()) {
+      throw std::out_of_range("Cannot pop_front() from empty buffer");
+    }
+
+    double front = prices.front();
+
+    if (--sorted_prices[front] == 0)
+      sorted_prices.erase(front);
+    prices.pop_front();
+  }
+
+  size_t size() const { return prices.size(); }
+
+  double get_max() const {
+    if (prices.empty()) {
+      throw std::out_of_range("Cannot find max() of empty buffer");
+    }
+
+    return sorted_prices.rbegin()->first;
+  }
+
+  double get_min() const {
+    if (prices.empty()) {
+      throw std::out_of_range("Cannot find min() of empty buffer");
+    }
+
+    return sorted_prices.begin()->first;
+  }
+
+  /* methods & fields omitted for brevity */
+};

public/code/algorithms/extrema-circular-buffer/monotonic.cpp

@@ -0,0 +1,59 @@
+#include <deque>
+#include <stdexcept>
+#include <utility>
+
+class ExtremaCircularBuffer {
+public:
+  void push_back(double value) {
+    if (prices.size() == capacity) {
+      double front_value = prices.front();
+      pop_max(front_value);
+      prices.pop_front();
+    }
+
+    prices.push_back(value);
+    push_max(value);
+  }
+
+  void pop_front() {
+    if (prices.empty()) {
+      throw std::out_of_range("Cannot pop_front() from empty buffer");
+    }
+
+    double front_value = prices.front();
+    pop_max(front_value);
+    prices.pop_front();
+  }
+
+  double get_max() const {
+    if (prices.empty()) {
+      throw std::out_of_range("Cannot find max() of empty buffer");
+    }
+
+    return maxs.front().first;
+  }
+
+private:
+  void push_max(double value) {
+    size_t popped = 0;
+
+    while (!maxs.empty() && maxs.back().first < value) {
+      popped += maxs.back().second + 1;
+      maxs.pop_back();
+    }
+
+    maxs.emplace_back(value, popped);
+  }
+
+  void pop_max(double value) {
+    size_t popped = maxs.front().second;
+
+    if (popped == 0) {
+      maxs.pop_front();
+    } else {
+      --maxs.front().second;
+    }
+  }
+
+  /* methods & fields omitted for brevity */
+};

public/code/algorithms/extrema-circular-buffer/naive.cpp

@@ -0,0 +1,38 @@
+#include <algorithm>
+#include <deque>
+#include <stdexcept>
+
+class ExtremaCircularBuffer {
+public:
+  ExtremaCircularBuffer(size_t capacity) : capacity(capacity) {}
+
+  void push_back(double value) {
+    if (prices.size() == capacity) {
+      prices.pop_front();
+    }
+
+    prices.push_back(value);
+  }
+
+  void pop_front() {
+    if (prices.empty()) {
+      throw std::out_of_range("Cannot pop_front() from empty buffer");
+    }
+
+    prices.pop_front();
+  }
+
+  size_t size() const { return prices.size(); }
+
+  double get() const {
+    if (prices.empty()) {
+      throw std::out_of_range("Cannot find max() of empty buffer");
+    }
+
+    return *std::max_element(prices.begin(), prices.end());
+  }
+
+private:
+  std::deque<double> prices;
+  size_t capacity;
+};