Tag Archives: Maximum Gcd and Sum Solution

HackerRank : Week of Code 34 – Maximum Gcd and Sum

Maximum Gcd and Sum: Hackerrank Maximum Gcd and Sum : You are given two arrays  and  containing  elements each. Choose a pair of elements  such that:  belongs to array .  belongs to array .  is the maximum of all pairs . If there is more than one such pair  having maximum gcd, then choose the one with maximum sum. Print the sum of elements of this… Read More »