Microsoft OA | Nov 2023

Question

Given an array of length n. find the maximum pair sum which don't have common digits.
Example : n=6 , nums=[53,1,36,103,53,5]
in this case answer is 103+5 as they don't have common digits and maximum sum.
n<=10^5, nums[i]<=10^9
Note : if you can't find a pair, return -1;