305. Common to All Three
Core1000 ms256 MBSolved by 0%
Three lists of integers. Print every value that appears in all three, each
once, in increasing order. If there is none, print None.
Duplicates within a list do not matter: appearing twice in one list is still appearing in it.
Build a set from the first list, a set from the second, and then walk the third
checking membership in both. That is three linear passes rather than the
n * m * p of three nested loops.
Constraints - `1 ≤ n, m, p ≤ 100000` - `-1000000000 ≤ values ≤ 1000000000`
Input
The first line contains three integers n, m and p.
The second line contains n integers, the third m, the fourth p.
Output
Print the shared values in increasing order separated by single spaces, or None.
Input4 2 3
1 5 10 20
5 10
5 10 20
Output5 10
Notehas two values in all three lists and one in only two
Input1 1 1
1
2
3
OutputNone
Notehas nothing in common
Hints
Four rungs, in order. The last two open once you have submitted an attempt. A wrong one counts.
Hint 1Where to start
Hint 2The approachOpen hint 1 first. This one carries on from it.
Hint 3PseudocodeOpen hint 2 first. This one carries on from it.
Hint 4Full solutionOpen hint 3 first. This one carries on from it.