2966. Divide Array Into Arrays With Max Difference

remy727 · remy727 · commit 927584ebae5d · 2024-02-01T08:56:42.000+01:00
diff --git a/README.md b/README.md
@@ -490,6 +490,7 @@
 | 2785 | Sort Vowels in a String | [Ruby](./algorithms/ruby/2785-sort-vowels-in-a-string.rb) | Medium |
 | 2842 | Difference Between Ones and Zeros in Row and Column | [Ruby](./algorithms/ruby/2842-difference-between-ones-and-zeros-in-row-and-column.rb) | Medium |
 | 2849 | Determine if a Cell Is Reachable at a Given Time | [Ruby](./algorithms/ruby/2849-determine-if-a-cell-is-reachable-at-a-given-time) | Medium |
+| 2966 | Divide Array Into Arrays With Max Difference | [Ruby](./algorithms/ruby/2966-divide-array-into-arrays-with-max-difference) | Medium |
 
 ### Database
 | # | Title | Solution | Difficulty |
diff --git a/algorithms/ruby/2966-divide-array-into-arrays-with-max-difference.rb b/algorithms/ruby/2966-divide-array-into-arrays-with-max-difference.rb
@@ -0,0 +1,57 @@
+# frozen_string_literal: true
+
+# 2966. Divide Array Into Arrays With Max Difference
+# Medium
+# https://leetcode.com/problems/divide-array-into-arrays-with-max-difference
+
+=begin
+You are given an integer array nums of size n and a positive integer k.
+Divide the array into one or more arrays of size 3 satisfying the following conditions:
+* Each element of nums should be in exactly one array.
+* The difference between any two elements in one array is less than or equal to k.
+Return a 2D array containing all the arrays. If it is impossible to satisfy the conditions, return an empty array. And if there are multiple answers, return any of them.
+
+Example 1:
+Input: nums = [1,3,4,8,7,9,3,5,1], k = 2
+Output: [[1,1,3],[3,4,5],[7,8,9]]
+Explanation: We can divide the array into the following arrays: [1,1,3], [3,4,5] and [7,8,9].
+The difference between any two elements in each array is less than or equal to 2.
+Note that the order of elements is not important.
+
+Example 2:
+Input: nums = [1,3,3,2,7,3], k = 3
+Output: []
+Explanation: It is not possible to divide the array satisfying all the conditions.
+
+Constraints:
+* n == nums.length
+* 1 <= n <= 105
+* n is a multiple of 3.
+* 1 <= nums[i] <= 105
+* 1 <= k <= 105
+=end
+
+# @param {Integer[]} nums
+# @param {Integer} k
+# @return {Integer[][]}
+def divide_array(nums, k)
+  possible_array = []
+  nums.sort!
+  nums.each_slice(3) do |n|
+    return [] if n[2] - n[0] > k
+    possible_array << n
+  end
+  possible_array
+end
+
+# **************** #
+#       TEST       #
+# **************** #
+
+require "test/unit"
+class Test_divide_array < Test::Unit::TestCase
+  def test_
+    assert_equal [[1, 1, 3], [3, 4, 5], [7, 8, 9]], divide_array([1, 3, 4, 8, 7, 9, 3, 5, 1], 2)
+    assert_equal [], divide_array([1, 3, 3, 2, 7, 3], 3)
+  end
+end
