feat: update lc problems

solution/3300-3399/3359.Find Sorted Submatrices With Maximum Element at Most K/README.md

@@ -2,6 +2,11 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3359.Find%20Sorted%20Submatrices%20With%20Maximum%20Element%20at%20Most%20K/README.md
+tags:
+    - 栈
+    - 数组
+    - 矩阵
+    - 单调栈
 ---
 
 <!-- problem:start -->

solution/3300-3399/3359.Find Sorted Submatrices With Maximum Element at Most K/README_EN.md

@@ -2,6 +2,11 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3359.Find%20Sorted%20Submatrices%20With%20Maximum%20Element%20at%20Most%20K/README_EN.md
+tags:
+    - Stack
+    - Array
+    - Matrix
+    - Monotonic Stack
 ---
 
 <!-- problem:start -->

solution/3300-3399/3360.Stone Removal Game/README.md

@@ -2,6 +2,9 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3360.Stone%20Removal%20Game/README.md
+tags:
+    - 数学
+    - 模拟
 ---
 
 <!-- problem:start -->

solution/3300-3399/3360.Stone Removal Game/README_EN.md

@@ -2,6 +2,9 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3360.Stone%20Removal%20Game/README_EN.md
+tags:
+    - Math
+    - Simulation
 ---
 
 <!-- problem:start -->

solution/3300-3399/3361.Shift Distance Between Two Strings/README.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3361.Shift%20Distance%20Between%20Two%20Strings/README.md
+tags:
+    - 数组
+    - 字符串
+    - 前缀和
 ---
 
 <!-- problem:start -->

solution/3300-3399/3361.Shift Distance Between Two Strings/README_EN.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3361.Shift%20Distance%20Between%20Two%20Strings/README_EN.md
+tags:
+    - Array
+    - String
+    - Prefix Sum
 ---
 
 <!-- problem:start -->

solution/3300-3399/3362.Zero Array Transformation III/README.md

@@ -2,6 +2,12 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3362.Zero%20Array%20Transformation%20III/README.md
+tags:
+    - 贪心
+    - 数组
+    - 前缀和
+    - 排序
+    - 堆（优先队列）
 ---
 
 <!-- problem:start -->

solution/3300-3399/3362.Zero Array Transformation III/README_EN.md

@@ -2,6 +2,12 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3362.Zero%20Array%20Transformation%20III/README_EN.md
+tags:
+    - Greedy
+    - Array
+    - Prefix Sum
+    - Sorting
+    - Heap (Priority Queue)
 ---
 
 <!-- problem:start -->

solution/3300-3399/3363.Find the Maximum Number of Fruits Collected/README.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3363.Find%20the%20Maximum%20Number%20of%20Fruits%20Collected/README.md
+tags:
+    - 数组
+    - 动态规划
+    - 矩阵
 ---
 
 <!-- problem:start -->

solution/3300-3399/3363.Find the Maximum Number of Fruits Collected/README_EN.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3363.Find%20the%20Maximum%20Number%20of%20Fruits%20Collected/README_EN.md
+tags:
+    - Array
+    - Dynamic Programming
+    - Matrix
 ---
 
 <!-- problem:start -->

solution/3300-3399/3364.Minimum Positive Sum Subarray/README.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3364.Minimum%20Positive%20Sum%20Subarray/README.md
+tags:
+    - 数组
+    - 前缀和
+    - 滑动窗口
 ---
 
 <!-- problem:start -->

solution/3300-3399/3364.Minimum Positive Sum Subarray/README_EN.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3364.Minimum%20Positive%20Sum%20Subarray/README_EN.md
+tags:
+    - Array
+    - Prefix Sum
+    - Sliding Window
 ---
 
 <!-- problem:start -->

solution/3300-3399/3365.Rearrange K Substrings to Form Target String/README.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3365.Rearrange%20K%20Substrings%20to%20Form%20Target%20String/README.md
+tags:
+    - 哈希表
+    - 字符串
+    - 排序
 ---
 
 <!-- problem:start -->

solution/3300-3399/3365.Rearrange K Substrings to Form Target String/README_EN.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3365.Rearrange%20K%20Substrings%20to%20Form%20Target%20String/README_EN.md
+tags:
+    - Hash Table
+    - String
+    - Sorting
 ---
 
 <!-- problem:start -->

solution/3300-3399/3366.Minimum Array Sum/README.md

@@ -2,6 +2,9 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3366.Minimum%20Array%20Sum/README.md
+tags:
+    - 数组
+    - 动态规划
 ---
 
 <!-- problem:start -->

solution/3300-3399/3366.Minimum Array Sum/README_EN.md

@@ -2,6 +2,9 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3366.Minimum%20Array%20Sum/README_EN.md
+tags:
+    - Array
+    - Dynamic Programming
 ---
 
 <!-- problem:start -->

solution/3300-3399/3367.Maximize Sum of Weights after Edge Removals/README.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3367.Maximize%20Sum%20of%20Weights%20after%20Edge%20Removals/README.md
+tags:
+    - 树
+    - 深度优先搜索
+    - 动态规划
 ---
 
 <!-- problem:start -->

solution/3300-3399/3367.Maximize Sum of Weights after Edge Removals/README_EN.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3367.Maximize%20Sum%20of%20Weights%20after%20Edge%20Removals/README_EN.md
+tags:
+    - Tree
+    - Depth-First Search
+    - Dynamic Programming
 ---
 
 <!-- problem:start -->

solution/3300-3399/3369.Design an Array Statistics Tracker/README.md

@@ -0,0 +1,135 @@
+---
+comments: true
+difficulty: 困难
+edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3369.Design%20an%20Array%20Statistics%20Tracker/README.md
+tags:
+    - 队列
+    - 哈希表
+    - 二分查找
+---
+
+<!-- problem:start -->
+
+# [3369. Design an Array Statistics Tracker 🔒](https://leetcode.cn/problems/design-an-array-statistics-tracker)
+
+[English Version](/solution/3300-3399/3369.Design%20an%20Array%20Statistics%20Tracker/README_EN.md)
+
+## 题目描述
+
+<!-- description:start -->
+
+<p>Design a data structure that keeps track of the values in it and answers some queries regarding their mean, median, and mode.</p>
+
+<p>Implement the <code>StatisticsTracker</code> class.</p>
+
+<ul>
+	<li><code>StatisticsTracker()</code>: Initialize&nbsp;the <code>StatisticsTracker</code> object with an empty array.</li>
+	<li><code>void addNumber(int number)</code>: Add&nbsp;<code>number</code> to the data structure.</li>
+	<li><code>void removeFirstAddedNumber()</code>: Remove&nbsp;the earliest added number from the data structure.</li>
+	<li><code>int getMean()</code>: Return&nbsp;the floored <strong>mean</strong> of the numbers in the data structure.</li>
+	<li><code>int getMedian()</code>: Return&nbsp;the <strong>median</strong> of the numbers in the data structure.</li>
+	<li><code>int getMode()</code>: Return&nbsp;the <strong>mode</strong> of the numbers in the data structure. If there are multiple modes, return the smallest one.</li>
+</ul>
+
+<p><strong>Note</strong>:</p>
+
+<ul>
+	<li>The <strong>mean</strong> of an array is the sum of all the values divided by the number of values in the array.</li>
+	<li>The <strong>median</strong> of an array is the middle element of the array when it is sorted in non-decreasing order. If there are two choices for a median, the larger of the two values is taken.</li>
+	<li>The <strong>mode</strong> of an array is the element that appears most often in the array.</li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong><br />
+<span class="example-io">[&quot;StatisticsTracker&quot;, &quot;addNumber&quot;, &quot;addNumber&quot;, &quot;addNumber&quot;, &quot;addNumber&quot;, &quot;getMean&quot;, &quot;getMedian&quot;, &quot;getMode&quot;, &quot;removeFirstAddedNumber&quot;, &quot;getMode&quot;]<br />
+[[], [4], [4], [2], [3], [], [], [], [], []]</span></p>
+
+<p><strong>Output:</strong><br />
+<span class="example-io">[null, null, null, null, null, 3, 4, 4, null, 2] </span></p>
+
+<p><strong>Explanation</strong></p>
+StatisticsTracker statisticsTracker = new StatisticsTracker();<br />
+statisticsTracker.addNumber(4); // The data structure now contains [4]<br />
+statisticsTracker.addNumber(4); // The data structure now contains [4, 4]<br />
+statisticsTracker.addNumber(2); // The data structure now contains [4, 4, 2]<br />
+statisticsTracker.addNumber(3); // The data structure now contains [4, 4, 2, 3]<br />
+statisticsTracker.getMean(); // return 3<br />
+statisticsTracker.getMedian(); // return 4<br />
+statisticsTracker.getMode(); // return 4<br />
+statisticsTracker.removeFirstAddedNumber(); // The data structure now contains [4, 2, 3]<br />
+statisticsTracker.getMode(); // return 2</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong><br />
+<span class="example-io">[&quot;StatisticsTracker&quot;, &quot;addNumber&quot;, &quot;addNumber&quot;, &quot;getMean&quot;, &quot;removeFirstAddedNumber&quot;, &quot;addNumber&quot;, &quot;addNumber&quot;, &quot;removeFirstAddedNumber&quot;, &quot;getMedian&quot;, &quot;addNumber&quot;, &quot;getMode&quot;]<br />
+[[], [9], [5], [], [], [5], [6], [], [], [8], []]</span></p>
+
+<p><strong>Output:</strong><br />
+<span class="example-io">[null, null, null, 7, null, null, null, null, 6, null, 5] </span></p>
+
+<p><strong>Explanation</strong></p>
+StatisticsTracker statisticsTracker = new StatisticsTracker();<br />
+statisticsTracker.addNumber(9); // The data structure now contains [9]<br />
+statisticsTracker.addNumber(5); // The data structure now contains [9, 5]<br />
+statisticsTracker.getMean(); // return 7<br />
+statisticsTracker.removeFirstAddedNumber(); // The data structure now contains [5]<br />
+statisticsTracker.addNumber(5); // The data structure now contains [5, 5]<br />
+statisticsTracker.addNumber(6); // The data structure now contains [5, 5, 6]<br />
+statisticsTracker.removeFirstAddedNumber(); // The data structure now contains [5, 6]<br />
+statisticsTracker.getMedian(); // return 6<br />
+statisticsTracker.addNumber(8); // The data structure now contains [5, 6, 8]<br />
+statisticsTracker.getMode(); // return 5</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= number &lt;= 10<sup>9</sup></code></li>
+	<li>At most, <code>10<sup>5</sup></code> calls will be made to <code>addNumber</code>, <code>removeFirstAddedNumber</code>, <code>getMean</code>, <code>getMedian</code>, and <code>getMode</code> in total.</li>
+	<li><code>removeFirstAddedNumber</code>, <code>getMean</code>, <code>getMedian</code>, and <code>getMode</code> will be called only if there is at least one element in the data structure.</li>
+</ul>
+
+<!-- description:end -->
+
+## 解法
+
+<!-- solution:start -->
+
+### 方法一
+
+<!-- tabs:start -->
+
+#### Python3
+
+```python
+
+```
+
+#### Java
+
+```java
+
+```
+
+#### C++
+
+```cpp
+
+```
+
+#### Go
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- problem:end -->