**Question**\n\nThree arrays of same or different size are given. A happy triplet is defined as the triplet such that **|maximum-minimum|** in that triplet is the minimum of all the triplet. A triplet should be select in such a way that it contain one element from the given three arrays. If there are two or more triplets with same minimum difference then the triplet with the smallest sum of elements should be print.Print the triplet in decreasing order.\n\n**Example:1**\n\narray1=[5,2,8]\narray2=[10,7,12,14]\narray3=[9,14,6]\noutput: [7,6,5]\nExplanation: The triplet [5,7,6] has the mimimum difference |7-5|=2 as compare to all other triplets present.(5 is from array1, 7 is from array2, 6 is from array3)\n\n**Example:2**\n\narray1=[3,2,6]\narray2=[4,3,8]\narray3=[6,5,4]\noutput: [4,3,2]\nExplanation: The triplet [3,4,5]  and [2,3,4] has the same mimimum difference of 2.\nBut the triplet [2,3,4] has the minimum sum so return this triplet.\n\n**constraint:** 1<=n<=10^5\n\n\n\n\n

Question\n\nThree arrays of same or different size are given. A happy triplet is defined as the triplet such that |maximum-minimum| in that triplet is the minim