#2966

Divide Array Into Arrays With Max Difference

medium · 79% accepted · 1,165 likes · top 90%

array · greedy · sorting

⊣ practice⊣ open on leetcode ↗

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.

Solution