Divide Array Into Arrays With Max Difference

https://leetcode.com/problems/divide-array-into-arrays-with-max-difference/

class Solution:
    def divideArray(self, nums: List[int], k: int) -> List[List[int]]:
        nums.sort()
        res = []
        
        for i in range(0, len(nums), 3):
            if nums[i + 2] -nums[i] > k:
                return []
            res.append(nums[i: i+3])
        return res

by sorting nums we can have the least difference in each subarray.

we check if every subarray matches criteria k