diff --git a/solution/2200-2299/2221.Find Triangular Sum of an Array/README.md b/solution/2200-2299/2221.Find Triangular Sum of an Array/README.md
index 6ddb5ef530707..d33e05a6f7271 100644
--- a/solution/2200-2299/2221.Find Triangular Sum of an Array/README.md	
+++ b/solution/2200-2299/2221.Find Triangular Sum of an Array/README.md	
@@ -145,6 +145,38 @@ function triangularSum(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn triangular_sum(mut nums: Vec<i32>) -> i32 {
+        let mut k = nums.len() as i32 - 1;
+        while k > 0 {
+            for i in 0..k as usize {
+                nums[i] = (nums[i] + nums[i + 1]) % 10;
+            }
+            k -= 1;
+        }
+        nums[0]
+    }
+}
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int TriangularSum(int[] nums) {
+        for (int k = nums.Length - 1; k > 0; --k) {
+            for (int i = 0; i < k; ++i) {
+                nums[i] = (nums[i] + nums[i + 1]) % 10;
+            }
+        }
+        return nums[0];
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/2200-2299/2221.Find Triangular Sum of an Array/README_EN.md b/solution/2200-2299/2221.Find Triangular Sum of an Array/README_EN.md
index 7af4442da995c..42ce3661a1c7d 100644
--- a/solution/2200-2299/2221.Find Triangular Sum of an Array/README_EN.md	
+++ b/solution/2200-2299/2221.Find Triangular Sum of an Array/README_EN.md	
@@ -141,6 +141,38 @@ function triangularSum(nums: number[]): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn triangular_sum(mut nums: Vec<i32>) -> i32 {
+        let mut k = nums.len() as i32 - 1;
+        while k > 0 {
+            for i in 0..k as usize {
+                nums[i] = (nums[i] + nums[i + 1]) % 10;
+            }
+            k -= 1;
+        }
+        nums[0]
+    }
+}
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int TriangularSum(int[] nums) {
+        for (int k = nums.Length - 1; k > 0; --k) {
+            for (int i = 0; i < k; ++i) {
+                nums[i] = (nums[i] + nums[i + 1]) % 10;
+            }
+        }
+        return nums[0];
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/2200-2299/2221.Find Triangular Sum of an Array/Solution.cs b/solution/2200-2299/2221.Find Triangular Sum of an Array/Solution.cs
new file mode 100644
index 0000000000000..49ffb5d837228
--- /dev/null
+++ b/solution/2200-2299/2221.Find Triangular Sum of an Array/Solution.cs	
@@ -0,0 +1,10 @@
+public class Solution {
+    public int TriangularSum(int[] nums) {
+        for (int k = nums.Length - 1; k > 0; --k) {
+            for (int i = 0; i < k; ++i) {
+                nums[i] = (nums[i] + nums[i + 1]) % 10;
+            }
+        }
+        return nums[0];
+    }
+}
diff --git a/solution/2200-2299/2221.Find Triangular Sum of an Array/Solution.rs b/solution/2200-2299/2221.Find Triangular Sum of an Array/Solution.rs
new file mode 100644
index 0000000000000..4cdb50a58487a
--- /dev/null
+++ b/solution/2200-2299/2221.Find Triangular Sum of an Array/Solution.rs	
@@ -0,0 +1,12 @@
+impl Solution {
+    pub fn triangular_sum(mut nums: Vec<i32>) -> i32 {
+        let mut k = nums.len() as i32 - 1;
+        while k > 0 {
+            for i in 0..k as usize {
+                nums[i] = (nums[i] + nums[i + 1]) % 10;
+            }
+            k -= 1;
+        }
+        nums[0]
+    }
+}