Given an array of positive integers nums of length N, we need to find the maximum sum of two integers that do not have any common digit between them.

1<=N<=2e5 1<=nums[i]<=1e9

Eg. N = 6 nums = 53 1 36 103 53 5 ans = 103+5 = 108

This question was asked as part of Microsoft Online Assessment

After today's round(12-11-22),the next CF round is on 25th. I cannot wait so long for the next contest.I hope more contests are added for this month.

Update: Div 3 round added on 18th.Wohoo!