Divide Array Into Arrays With Max Difference | Leetcode 2966

class Solution {
public:
    vector<vector<int>> divideArray(vector<int>& nums, int k) {
        sort(nums.begin(),nums.end());
        int n=nums.size();

        vector<vector<int>> res;
        for(int i=2;i<n;i+=3){
            if(nums[i]-nums[i-2]>k)
                return {};
            res.push_back({nums[i-2],nums[i-1],nums[i]});
        }
        return res;
    }
};
/*
//JAVA
import java.util.Arrays;
import java.util.ArrayList;
import java.util.List;

class Solution {
    public List<List<Integer>> divideArray(int[] nums, int k) {
        Arrays.sort(nums);
        int n = nums.length;
        
        List<List<Integer>> res = new ArrayList<>();
        for (int i = 2; i < n; i += 3) {
            if (nums[i] - nums[i - 2] > k) {
                return new ArrayList<>();
            }
            List<Integer> triplet = new ArrayList<>();
            triplet.add(nums[i - 2]);
            triplet.add(nums[i - 1]);
            triplet.add(nums[i]);
            res.add(triplet);
        }
        return res;
    }
}

#Python
class Solution:
    def divideArray(self, nums: List[int], k: int) -> List[List[int]]:
        nums.sort()
        n = len(nums)
        res = []
        
        for i in range(2, n, 3):
            if nums[i] - nums[i - 2] > k:
                return []
            res.append([nums[i - 2], nums[i - 1], nums[i]])
        
        return res
*/