Jun 19

Author: siddydutta

2025-06-June-LeetCoding-Challenge/Partition Array Such That Maximum Difference Is K.py

@@ -0,0 +1,28 @@
+class Solution:
+    def partitionArray(self, nums: list[int], k: int) -> int:
+        nums.sort()
+        curr_min = nums[0]
+        count = 1
+        for num in nums[1:]:
+            if num - curr_min > k:
+                count += 1
+                curr_min = num
+        return count
+
+
+def main():
+    nums = [3, 6, 1, 2, 5]
+    k = 2
+    assert Solution().partitionArray(nums, k) == 2
+
+    nums = [1, 2, 3]
+    k = 1
+    assert Solution().partitionArray(nums, k) == 2
+
+    nums = [2, 2, 4, 5]
+    k = 0
+    assert Solution().partitionArray(nums, k) == 3
+
+
+if __name__ == '__main__':
+    main()

2025-06-June-LeetCoding-Challenge/README.md

@@ -22,7 +22,7 @@
 | June 16 | [2016. Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/) | Easy | Solved |
 | June 17 | [3405. Count the Number of Arrays with K Matching Adjacent Elements](https://leetcode.com/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements/) | Hard | Unsolved |
 | June 18 | [2966. Divide Array Into Arrays With Max Difference](https://leetcode.com/problems/divide-array-into-arrays-with-max-difference/) | Medium | Solved |
-| June 19 | []() |  |  |
+| June 19 | [2294. Partition Array Such That Maximum Difference Is K](https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k/) | Medium | Solved |
 | June 20 | []() |  |  |
 | June 21 | []() |  |  |
 | June 22 | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 3 | 3 | 0 |
-| Medium | 8 | 5 | 3 |
+| Medium | 9 | 6 | 3 |
 | Hard   | 5 | 2 | 3 |