2966. Divide Array Into Arrays With Max Difference

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

Python

class Solution:
    def divideArray(self, nums: List[int], k: int) -> List[List[int]]:
        nums.sort()
        result = []
        for i in range(1, len(nums), 3):
            if  nums[i]-nums[i-1] <= k \
            and nums[i+1]-nums[i] <= k \
            and nums[i+1]-nums[i-1] <= k:
                result.append([nums[i-1], nums[i], nums[i+1]])
            else:
                return []

        return result