Add solution #2034

JoshCrozier · JoshCrozier · commit d19a16e7c39c · 2025-07-25T00:23:12.000-05:00
diff --git a/README.md b/README.md
@@ -1844,6 +1844,7 @@
 2031|[Count Subarrays With More Ones Than Zeros](./solutions/2031-count-subarrays-with-more-ones-than-zeros.js)|Medium|
 2032|[Two Out of Three](./solutions/2032-two-out-of-three.js)|Easy|
 2033|[Minimum Operations to Make a Uni-Value Grid](./solutions/2033-minimum-operations-to-make-a-uni-value-grid.js)|Medium|
+2034|[Stock Price Fluctuation](./solutions/2034-stock-price-fluctuation.js)|Medium|
 2035|[Partition Array Into Two Arrays to Minimize Sum Difference](./solutions/2035-partition-array-into-two-arrays-to-minimize-sum-difference.js)|Hard|
 2036|[Maximum Alternating Subarray Sum](./solutions/2036-maximum-alternating-subarray-sum.js)|Medium|
 2037|[Minimum Number of Moves to Seat Everyone](./solutions/2037-minimum-number-of-moves-to-seat-everyone.js)|Easy|
diff --git a/solutions/2034-stock-price-fluctuation.js b/solutions/2034-stock-price-fluctuation.js
@@ -0,0 +1,82 @@
+/**
+ * 2034. Stock Price Fluctuation
+ * https://leetcode.com/problems/stock-price-fluctuation/
+ * Difficulty: Medium
+ *
+ * You are given a stream of records about a particular stock. Each record contains a timestamp
+ * and the corresponding price of the stock at that timestamp.
+ *
+ * Unfortunately due to the volatile nature of the stock market, the records do not come in order.
+ * Even worse, some records may be incorrect. Another record with the same timestamp may appear
+ * later in the stream correcting the price of the previous wrong record.
+ *
+ * Design an algorithm that:
+ * - Updates the price of the stock at a particular timestamp, correcting the price from any
+ *   previous records at the timestamp.
+ * - Finds the latest price of the stock based on the current records. The latest price is the
+ *   price at the latest timestamp recorded.
+ * - Finds the maximum price the stock has been based on the current records.
+ * - Finds the minimum price the stock has been based on the current records.
+ *
+ * Implement the StockPrice class:
+ * - StockPrice() Initializes the object with no price records.
+ * - void update(int timestamp, int price) Updates the price of the stock at the given timestamp.
+ * - int current() Returns the latest price of the stock.
+ * - int maximum() Returns the maximum price of the stock.
+ * - int minimum() Returns the minimum price of the stock.
+ */
+
+var StockPrice = function() {
+  this.timestamps = new Map();
+  this.highestTimestamp = 0;
+  this.minHeap = new PriorityQueue((a, b) => a[0] - b[0]);
+  this.maxHeap = new PriorityQueue((a, b) => b[0] - a[0]);
+};
+
+/**
+ * @param {number} timestamp
+ * @param {number} price
+ * @return {void}
+ */
+StockPrice.prototype.update = function(timestamp, price) {
+  this.timestamps.set(timestamp, price);
+  this.highestTimestamp = Math.max(this.highestTimestamp, timestamp);
+
+  this.minHeap.enqueue([price, timestamp]);
+  this.maxHeap.enqueue([price, timestamp]);
+};
+
+/**
+ * @return {number}
+ */
+StockPrice.prototype.current = function() {
+  return this.timestamps.get(this.highestTimestamp);
+};
+
+/**
+ * @return {number}
+ */
+StockPrice.prototype.maximum = function() {
+  let [currPrice, timestamp] = this.maxHeap.dequeue();
+
+  while (currPrice !== this.timestamps.get(timestamp)) {
+    [currPrice, timestamp] = this.maxHeap.dequeue();
+  }
+
+  this.maxHeap.enqueue([currPrice, timestamp]);
+  return currPrice;
+};
+
+/**
+ * @return {number}
+ */
+StockPrice.prototype.minimum = function() {
+  let [currPrice, timestamp] = this.minHeap.dequeue();
+
+  while (currPrice !== this.timestamps.get(timestamp)) {
+    [currPrice, timestamp] = this.minHeap.dequeue();
+  }
+
+  this.minHeap.enqueue([currPrice, timestamp]);
+  return currPrice;
+};
