You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Given three sorted arrays A, B and Cof not necessarily same sizes.
Calculate the minimum absolute difference between the maximum and minimum number from the triplet a, b, c such that a, b, c belongs arrays A, B, C respectively.
i.e. minimize | max(a,b,c) - min(a,b,c) |.*/
int Solution::solve(vector<int> &A, vector<int> &B, vector<int> &C) {
int diff,fi=A.size()-1,si=B.size()-1,ti=C.size()-1,ans=INT_MAX;