| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
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!
