diff --git a/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/README.md b/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/README.md
index 891a57897e89d..16b8ab97ba7f5 100644
--- a/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/README.md	
+++ b/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/README.md	
@@ -201,6 +201,60 @@ function maxSum(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn max_sum(nums: Vec<i32>) -> i32 {
+        let mx = *nums.iter().max().unwrap_or(&0);
+        if mx <= 0 {
+            return mx;
+        }
+
+        let mut s = HashSet::new();
+        let mut ans = 0;
+
+        for &x in &nums {
+            if x < 0 || s.contains(&x) {
+                continue;
+            }
+            ans += x;
+            s.insert(x);
+        }
+
+        ans
+    }
+}
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int MaxSum(int[] nums) {
+        int mx = nums.Max();
+        if (mx <= 0) {
+            return mx;
+        }
+
+        HashSet<int> s = new HashSet<int>();
+        int ans = 0;
+
+        foreach (int x in nums) {
+            if (x < 0 || s.Contains(x)) {
+                continue;
+            }
+            ans += x;
+            s.Add(x);
+        }
+
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/README_EN.md b/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/README_EN.md
index a08420d95bd61..e969cc95b3261 100644
--- a/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/README_EN.md	
+++ b/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/README_EN.md	
@@ -198,6 +198,60 @@ function maxSum(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn max_sum(nums: Vec<i32>) -> i32 {
+        let mx = *nums.iter().max().unwrap_or(&0);
+        if mx <= 0 {
+            return mx;
+        }
+
+        let mut s = HashSet::new();
+        let mut ans = 0;
+
+        for &x in &nums {
+            if x < 0 || s.contains(&x) {
+                continue;
+            }
+            ans += x;
+            s.insert(x);
+        }
+
+        ans
+    }
+}
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int MaxSum(int[] nums) {
+        int mx = nums.Max();
+        if (mx <= 0) {
+            return mx;
+        }
+
+        HashSet<int> s = new HashSet<int>();
+        int ans = 0;
+
+        foreach (int x in nums) {
+            if (x < 0 || s.Contains(x)) {
+                continue;
+            }
+            ans += x;
+            s.Add(x);
+        }
+
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/Solution.cs b/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/Solution.cs
new file mode 100644
index 0000000000000..811f4d4617fba
--- /dev/null
+++ b/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/Solution.cs	
@@ -0,0 +1,21 @@
+public class Solution {
+    public int MaxSum(int[] nums) {
+        int mx = nums.Max();
+        if (mx <= 0) {
+            return mx;
+        }
+
+        HashSet<int> s = new HashSet<int>();
+        int ans = 0;
+
+        foreach (int x in nums) {
+            if (x < 0 || s.Contains(x)) {
+                continue;
+            }
+            ans += x;
+            s.Add(x);
+        }
+
+        return ans;
+    }
+}
\ No newline at end of file
diff --git a/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/Solution.rs b/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/Solution.rs
new file mode 100644
index 0000000000000..721cd49bba02b
--- /dev/null
+++ b/solution/3400-3499/3487.Maximum Unique Subarray Sum After Deletion/Solution.rs	
@@ -0,0 +1,23 @@
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn max_sum(nums: Vec<i32>) -> i32 {
+        let mx = *nums.iter().max().unwrap_or(&0);
+        if mx <= 0 {
+            return mx;
+        }
+
+        let mut s = HashSet::new();
+        let mut ans = 0;
+
+        for &x in &nums {
+            if x < 0 || s.contains(&x) {
+                continue;
+            }
+            ans += x;
+            s.insert(x);
+        }
+
+        ans
+    }
+}
diff --git a/solution/3400-3499/3488.Closest Equal Element Queries/README.md b/solution/3400-3499/3488.Closest Equal Element Queries/README.md
index d7bdccb4b2088..6de35aed1872a 100644
--- a/solution/3400-3499/3488.Closest Equal Element Queries/README.md	
+++ b/solution/3400-3499/3488.Closest Equal Element Queries/README.md	
@@ -270,6 +270,93 @@ function solveQueries(nums: number[], queries: number[]): number[] {
 }
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn solve_queries(nums: Vec<i32>, queries: Vec<i32>) -> Vec<i32> {
+        let n = nums.len();
+        let m = n * 2;
+        let mut d = vec![m as i32; m];
+        let mut left = HashMap::new();
+
+        for i in 0..m {
+            let x = nums[i % n];
+            if let Some(&l) = left.get(&x) {
+                d[i] = d[i].min((i - l) as i32);
+            }
+            left.insert(x, i);
+        }
+
+        let mut right = HashMap::new();
+
+        for i in (0..m).rev() {
+            let x = nums[i % n];
+            if let Some(&r) = right.get(&x) {
+                d[i] = d[i].min((r - i) as i32);
+            }
+            right.insert(x, i);
+        }
+
+        for i in 0..n {
+            d[i] = d[i].min(d[i + n]);
+        }
+
+        queries.iter().map(|&query| {
+            if d[query as usize] >= n as i32 {
+                -1
+            } else {
+                d[query as usize]
+            }
+        }).collect()
+    }
+}
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public IList<int> SolveQueries(int[] nums, int[] queries) {
+        int n = nums.Length;
+        int m = n * 2;
+        int[] d = new int[m];
+        Array.Fill(d, m);
+
+        Dictionary<int, int> left = new Dictionary<int, int>();
+        for (int i = 0; i < m; i++) {
+            int x = nums[i % n];
+            if (left.ContainsKey(x)) {
+                d[i] = Math.Min(d[i], i - left[x]);
+            }
+            left[x] = i;
+        }
+
+        Dictionary<int, int> right = new Dictionary<int, int>();
+        for (int i = m - 1; i >= 0; i--) {
+            int x = nums[i % n];
+            if (right.ContainsKey(x)) {
+                d[i] = Math.Min(d[i], right[x] - i);
+            }
+            right[x] = i;
+        }
+
+        for (int i = 0; i < n; i++) {
+            d[i] = Math.Min(d[i], d[i + n]);
+        }
+
+        List<int> ans = new List<int>();
+        foreach (int query in queries) {
+            ans.Add(d[query] >= n ? -1 : d[query]);
+        }
+
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/3400-3499/3488.Closest Equal Element Queries/README_EN.md b/solution/3400-3499/3488.Closest Equal Element Queries/README_EN.md
index 0eab0861ed86b..c046da9a5d5e9 100644
--- a/solution/3400-3499/3488.Closest Equal Element Queries/README_EN.md	
+++ b/solution/3400-3499/3488.Closest Equal Element Queries/README_EN.md	
@@ -268,6 +268,93 @@ function solveQueries(nums: number[], queries: number[]): number[] {
 }
 ```
 
+#### Rust
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn solve_queries(nums: Vec<i32>, queries: Vec<i32>) -> Vec<i32> {
+        let n = nums.len();
+        let m = n * 2;
+        let mut d = vec![m as i32; m];
+        let mut left = HashMap::new();
+
+        for i in 0..m {
+            let x = nums[i % n];
+            if let Some(&l) = left.get(&x) {
+                d[i] = d[i].min((i - l) as i32);
+            }
+            left.insert(x, i);
+        }
+
+        let mut right = HashMap::new();
+
+        for i in (0..m).rev() {
+            let x = nums[i % n];
+            if let Some(&r) = right.get(&x) {
+                d[i] = d[i].min((r - i) as i32);
+            }
+            right.insert(x, i);
+        }
+
+        for i in 0..n {
+            d[i] = d[i].min(d[i + n]);
+        }
+
+        queries.iter().map(|&query| {
+            if d[query as usize] >= n as i32 {
+                -1
+            } else {
+                d[query as usize]
+            }
+        }).collect()
+    }
+}
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public IList<int> SolveQueries(int[] nums, int[] queries) {
+        int n = nums.Length;
+        int m = n * 2;
+        int[] d = new int[m];
+        Array.Fill(d, m);
+
+        Dictionary<int, int> left = new Dictionary<int, int>();
+        for (int i = 0; i < m; i++) {
+            int x = nums[i % n];
+            if (left.ContainsKey(x)) {
+                d[i] = Math.Min(d[i], i - left[x]);
+            }
+            left[x] = i;
+        }
+
+        Dictionary<int, int> right = new Dictionary<int, int>();
+        for (int i = m - 1; i >= 0; i--) {
+            int x = nums[i % n];
+            if (right.ContainsKey(x)) {
+                d[i] = Math.Min(d[i], right[x] - i);
+            }
+            right[x] = i;
+        }
+
+        for (int i = 0; i < n; i++) {
+            d[i] = Math.Min(d[i], d[i + n]);
+        }
+
+        List<int> ans = new List<int>();
+        foreach (int query in queries) {
+            ans.Add(d[query] >= n ? -1 : d[query]);
+        }
+
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/3400-3499/3488.Closest Equal Element Queries/Solution.cs b/solution/3400-3499/3488.Closest Equal Element Queries/Solution.cs
new file mode 100644
index 0000000000000..d16dd3f817932
--- /dev/null
+++ b/solution/3400-3499/3488.Closest Equal Element Queries/Solution.cs	
@@ -0,0 +1,37 @@
+public class Solution {
+    public IList<int> SolveQueries(int[] nums, int[] queries) {
+        int n = nums.Length;
+        int m = n * 2;
+        int[] d = new int[m];
+        Array.Fill(d, m);
+
+        Dictionary<int, int> left = new Dictionary<int, int>();
+        for (int i = 0; i < m; i++) {
+            int x = nums[i % n];
+            if (left.ContainsKey(x)) {
+                d[i] = Math.Min(d[i], i - left[x]);
+            }
+            left[x] = i;
+        }
+
+        Dictionary<int, int> right = new Dictionary<int, int>();
+        for (int i = m - 1; i >= 0; i--) {
+            int x = nums[i % n];
+            if (right.ContainsKey(x)) {
+                d[i] = Math.Min(d[i], right[x] - i);
+            }
+            right[x] = i;
+        }
+
+        for (int i = 0; i < n; i++) {
+            d[i] = Math.Min(d[i], d[i + n]);
+        }
+
+        List<int> ans = new List<int>();
+        foreach (int query in queries) {
+            ans.Add(d[query] >= n ? -1 : d[query]);
+        }
+
+        return ans;
+    }
+}
\ No newline at end of file
diff --git a/solution/3400-3499/3488.Closest Equal Element Queries/Solution.rs b/solution/3400-3499/3488.Closest Equal Element Queries/Solution.rs
new file mode 100644
index 0000000000000..0b59b2000e953
--- /dev/null
+++ b/solution/3400-3499/3488.Closest Equal Element Queries/Solution.rs	
@@ -0,0 +1,43 @@
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn solve_queries(nums: Vec<i32>, queries: Vec<i32>) -> Vec<i32> {
+        let n = nums.len();
+        let m = n * 2;
+        let mut d = vec![m as i32; m];
+        let mut left = HashMap::new();
+
+        for i in 0..m {
+            let x = nums[i % n];
+            if let Some(&l) = left.get(&x) {
+                d[i] = d[i].min((i - l) as i32);
+            }
+            left.insert(x, i);
+        }
+
+        let mut right = HashMap::new();
+
+        for i in (0..m).rev() {
+            let x = nums[i % n];
+            if let Some(&r) = right.get(&x) {
+                d[i] = d[i].min((r - i) as i32);
+            }
+            right.insert(x, i);
+        }
+
+        for i in 0..n {
+            d[i] = d[i].min(d[i + n]);
+        }
+
+        queries
+            .iter()
+            .map(|&query| {
+                if d[query as usize] >= n as i32 {
+                    -1
+                } else {
+                    d[query as usize]
+                }
+            })
+            .collect()
+    }
+}