feat: add solutions for lc No.3874 (#5094)

Author: yanglbme

solution/2000-2099/2045.Second Minimum Time to Reach Destination/README_EN.md

@@ -62,7 +62,7 @@ The red path shows the path to get the second minimum time.
 - Wait at 4 for 4 minutes, time elapsed=10
 - 4 -> 5: 3 minutes, time elapsed=13
 Hence the second minimum time is 13 minutes.
-    </pre>
+  </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/images/eg2.png" style="width: 225px; height: 50px;" />

solution/3200-3299/3212.Count Submatrices With Equal Frequency of X and Y/README.md

@@ -221,6 +221,39 @@ function numberOfSubmatrices(grid: string[][]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn number_of_submatrices(grid: Vec<Vec<char>>) -> i32 {
+        let m = grid.len();
+        let n = grid[0].len();
+        let mut s = vec![vec![vec![0i32; 2]; n + 1]; m + 1];
+        let mut ans = 0;
+
+        for i in 1..=m {
+            for j in 1..=n {
+                s[i][j][0] = s[i - 1][j][0]
+                    + s[i][j - 1][0]
+                    - s[i - 1][j - 1][0]
+                    + if grid[i - 1][j - 1] == 'X' { 1 } else { 0 };
+
+                s[i][j][1] = s[i - 1][j][1]
+                    + s[i][j - 1][1]
+                    - s[i - 1][j - 1][1]
+                    + if grid[i - 1][j - 1] == 'Y' { 1 } else { 0 };
+
+                if s[i][j][0] > 0 && s[i][j][0] == s[i][j][1] {
+                    ans += 1;
+                }
+            }
+        }
+
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3200-3299/3212.Count Submatrices With Equal Frequency of X and Y/README_EN.md

@@ -219,6 +219,39 @@ function numberOfSubmatrices(grid: string[][]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn number_of_submatrices(grid: Vec<Vec<char>>) -> i32 {
+        let m = grid.len();
+        let n = grid[0].len();
+        let mut s = vec![vec![vec![0i32; 2]; n + 1]; m + 1];
+        let mut ans = 0;
+
+        for i in 1..=m {
+            for j in 1..=n {
+                s[i][j][0] = s[i - 1][j][0]
+                    + s[i][j - 1][0]
+                    - s[i - 1][j - 1][0]
+                    + if grid[i - 1][j - 1] == 'X' { 1 } else { 0 };
+
+                s[i][j][1] = s[i - 1][j][1]
+                    + s[i][j - 1][1]
+                    - s[i - 1][j - 1][1]
+                    + if grid[i - 1][j - 1] == 'Y' { 1 } else { 0 };
+
+                if s[i][j][0] > 0 && s[i][j][0] == s[i][j][1] {
+                    ans += 1;
+                }
+            }
+        }
+
+        ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/3200-3299/3212.Count Submatrices With Equal Frequency of X and Y/Solution.rs

@@ -0,0 +1,28 @@
+impl Solution {
+    pub fn number_of_submatrices(grid: Vec<Vec<char>>) -> i32 {
+        let m = grid.len();
+        let n = grid[0].len();
+        let mut s = vec![vec![vec![0i32; 2]; n + 1]; m + 1];
+        let mut ans = 0;
+
+        for i in 1..=m {
+            for j in 1..=n {
+                s[i][j][0] = s[i - 1][j][0]
+                    + s[i][j - 1][0]
+                    - s[i - 1][j - 1][0]
+                    + if grid[i - 1][j - 1] == 'X' { 1 } else { 0 };
+
+                s[i][j][1] = s[i - 1][j][1]
+                    + s[i][j - 1][1]
+                    - s[i - 1][j - 1][1]
+                    + if grid[i - 1][j - 1] == 'Y' { 1 } else { 0 };
+
+                if s[i][j][0] > 0 && s[i][j][0] == s[i][j][1] {
+                    ans += 1;
+                }
+            }
+        }
+
+        ans
+    }
+}

solution/3800-3899/3865.Reverse K Subarrays/README.md

@@ -2,6 +2,9 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3865.Reverse%20K%20Subarrays/README.md
+tags:
+    - 数组
+    - 双指针
 ---
 
 <!-- problem:start -->

solution/3800-3899/3865.Reverse K Subarrays/README_EN.md

@@ -2,6 +2,9 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3865.Reverse%20K%20Subarrays/README_EN.md
+tags:
+    - Array
+    - Two Pointers
 ---
 
 <!-- problem:start -->

solution/3800-3899/3866.First Unique Even Element/README.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3866.First%20Unique%20Even%20Element/README.md
+tags:
+    - 数组
+    - 哈希表
+    - 计数
 ---
 
 <!-- problem:start -->

solution/3800-3899/3866.First Unique Even Element/README_EN.md

@@ -2,6 +2,10 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3866.First%20Unique%20Even%20Element/README_EN.md
+tags:
+    - Array
+    - Hash Table
+    - Counting
 ---
 
 <!-- problem:start -->

solution/3800-3899/3867.Sum of GCD of Formed Pairs/README.md

@@ -2,6 +2,12 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3867.Sum%20of%20GCD%20of%20Formed%20Pairs/README.md
+tags:
+    - 数组
+    - 数学
+    - 双指针
+    - 数论
+    - 模拟
 ---
 
 <!-- problem:start -->

solution/3800-3899/3867.Sum of GCD of Formed Pairs/README_EN.md

@@ -2,6 +2,12 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3867.Sum%20of%20GCD%20of%20Formed%20Pairs/README_EN.md
+tags:
+    - Array
+    - Math
+    - Two Pointers
+    - Number Theory
+    - Simulation
 ---
 
 <!-- problem:start -->