Jun 18

Author: siddydutta

2025-06-June-LeetCoding-Challenge/Divide Array Into Arrays With Max Difference.py

@@ -0,0 +1,23 @@
+class Solution:
+    def divideArray(self, nums: list[int], k: int) -> list[list[int]]:
+        nums.sort()
+        result = []
+        for i in range(0, len(nums), 3):
+            if nums[i + 2] - nums[i] > k:
+                return []
+            result.append(nums[i: i + 3])
+        return result
+
+
+def main():
+    nums = [1, 3, 4, 8, 7, 9, 3, 5, 1]
+    k = 2
+    assert Solution().divideArray(nums, k) == [[1, 1, 3], [3, 4, 5], [7, 8, 9]]
+
+    nums = [1, 3, 3, 2, 7, 3]
+    k = 3
+    assert Solution().divideArray(nums, k) == []
+
+
+if __name__ == '__main__':
+    main()

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

@@ -21,7 +21,7 @@
 | June 15 | []() |  |  |
 | 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 | []() |  |  |
+| 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 20 | []() |  |  |
 | June 21 | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 3 | 3 | 0 |
-| Medium | 7 | 4 | 3 |
+| Medium | 8 | 5 | 3 |
 | Hard   | 5 | 2 | 3 |