diff --git a/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README.md b/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README.md
index 69b53d410c102..55d975fb6b0c0 100644
--- a/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README.md	
+++ b/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README.md	
@@ -173,6 +173,48 @@ function partitionArray(nums: number[], k: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn partition_array(mut nums: Vec<i32>, k: i32) -> i32 {
+        nums.sort();
+        let mut ans = 1;
+        let mut a = nums[0];
+
+        for &b in nums.iter() {
+            if b - a > k {
+                a = b;
+                ans += 1;
+            }
+        }
+
+        ans
+    }
+}
+```
+
+#### Rust
+
+```rust
+public class Solution {
+    public int PartitionArray(int[] nums, int k) {
+        Array.Sort(nums);
+        int ans = 1;
+        int a = nums[0];
+
+        foreach (int b in nums) {
+            if (b - a > k) {
+                a = b;
+                ans++;
+            }
+        }
+
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README_EN.md b/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README_EN.md
index 3b4c283347c28..807b6a9903d98 100644
--- a/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README_EN.md	
+++ b/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/README_EN.md	
@@ -171,6 +171,48 @@ function partitionArray(nums: number[], k: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn partition_array(mut nums: Vec<i32>, k: i32) -> i32 {
+        nums.sort();
+        let mut ans = 1;
+        let mut a = nums[0];
+
+        for &b in nums.iter() {
+            if b - a > k {
+                a = b;
+                ans += 1;
+            }
+        }
+
+        ans
+    }
+}
+```
+
+#### Rust
+
+```rust
+public class Solution {
+    public int PartitionArray(int[] nums, int k) {
+        Array.Sort(nums);
+        int ans = 1;
+        int a = nums[0];
+
+        foreach (int b in nums) {
+            if (b - a > k) {
+                a = b;
+                ans++;
+            }
+        }
+
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/Solution.cs b/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/Solution.cs
new file mode 100644
index 0000000000000..e30f6b8c899ea
--- /dev/null
+++ b/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/Solution.cs	
@@ -0,0 +1,16 @@
+public class Solution {
+    public int PartitionArray(int[] nums, int k) {
+        Array.Sort(nums);
+        int ans = 1;
+        int a = nums[0];
+
+        foreach (int b in nums) {
+            if (b - a > k) {
+                a = b;
+                ans++;
+            }
+        }
+
+        return ans;
+    }
+}
diff --git a/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/Solution.rs b/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/Solution.rs
new file mode 100644
index 0000000000000..73c8b0c1887b1
--- /dev/null
+++ b/solution/2200-2299/2294.Partition Array Such That Maximum Difference Is K/Solution.rs	
@@ -0,0 +1,16 @@
+impl Solution {
+    pub fn partition_array(mut nums: Vec<i32>, k: i32) -> i32 {
+        nums.sort();
+        let mut ans = 1;
+        let mut a = nums[0];
+
+        for &b in nums.iter() {
+            if b - a > k {
+                a = b;
+                ans += 1;
+            }
+        }
+
+        ans
+    }
+}