FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 3241,3  "name": "divide-array-into-arrays-with-max-difference",4  "difficulty": "Medium",5  "link": "https://leetcode.com/problems/divide-array-into-arrays-with-max-difference/",6  "date": "2023-12-10",7  "task_description": "You are given an integer array `nums` of size `n` where `n` is a multiple of 3 and a positive integer `k`. Divide the array `nums` into `n / 3` arrays of size **3** satisfying the following condition: The difference between **any** two elements in one array is **less than or equal** to `k`. Return a **2D** array containing 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:** The difference between any two elements in each array is less than or equal to 2. **Example 2:** **Input:** nums = [2,4,2,2,5,2], k = 2 **Output:** [] **Explanation:** Different ways to divide `nums` into 2 arrays of size 3 are: [[2,2,2],[2,4,5]] (and its permutations) [[2,2,4],[2,2,5]] (and its permutations) Because there are four 2s there will be an array with the elements 2 and 5 no matter how we divide it. since `5 - 2 = 3 > k`, the condition is not satisfied and so there is no valid division. **Example 3:** **Input:** nums = [4,2,9,8,2,12,7,12,10,5,8,5,5,7,9,2,5,11], k = 14 **Output:** [[2,2,12],[4,8,5],[5,9,7],[7,8,5],[5,9,10],[11,12,2]] **Explanation:** The difference between any two elements in each array is less than or equal to 14. **Constraints:** `n == nums.length` `1 <= n <= 105` `n `is a multiple of 3 `1 <= nums[i] <= 105` `1 <= k <= 105`",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [1,3,4,8,7,9,3,5,1], k = 2",12      "output": "[[1,1,3],[3,4,5],[7,8,9]] "13    },14    {15      "label": "Example 2",16      "input": "nums = [2,4,2,2,5,2], k = 2",17      "output": "[] "18    },19    {20      "label": "Example 3",21      "input": "nums = [4,2,9,8,2,12,7,12,10,5,8,5,5,7,9,2,5,11], k = 14",22      "output": "[[2,2,12],[4,8,5],[5,9,7],[7,8,5],[5,9,10],[11,12,2]] "23    }24  ],25  "constraints": [26    "The difference between any two elements in one array is less than or equal to k.",27    "[[2,2,2],[2,4,5]] (and its permutations)",28    "[[2,2,4],[2,2,5]] (and its permutations)",29    "n == nums.length",30    "1 <= n <= 105",31    "n is a multiple of 3",32    "1 <= nums[i] <= 105",33    "1 <= k <= 105"34  ],35  "python_template": "class Solution(object):\n    def divideArray(self, nums, k):\n        \"\"\"\n        :type nums: List[int]\n        :type k: int\n        :rtype: List[List[int]]\n        \"\"\"\n        ",36  "java_template": "class Solution {\n    public int[][] divideArray(int[] nums, int k) {\n        \n    }\n}",37  "metadata": {38    "func_name": "divideArray"39  }40}