9.md

Divide Array into arrays with max difference

vector<vector<int>> divideArray(vector<int>& nums, int k) {
        vector<vector<int>>ans(nums.size()/3,vector<int>(3));

        sort(nums.begin(),nums.end());
        int j=0;

        for(int i=0;i<nums.size();i+=3)
        {
            if(i+2 <nums.size() && nums[i+2]-nums[i]<=k)
            {
                ans[j++]={nums[i],nums[i+1],nums[i+2]};
            }
            else
                return vector<vector<int>>();
        }

        return ans;
    }