Problem Description
Given are Three arrays A, B and C.
Return the sorted list of numbers that are present in atleast 2 out of the 3 arrays.
1 <= |A|, |B|, |C| <= 100000
1 <= A[i], B[i], C[i] <= 100000
A, B, C may or may not have pairwise distinct elements.
First argument is the array A.
First argument is the array B.
First argument is the array C.
Return a sorted array of numbers.
Input 1:
A = [1, 1, 2] B = [2, 3] C = [3]
Input 2:
A = [1, 2] B = [1, 3] C = [2, 3]
Output 1:
[2, 3]
Output 2:
[1, 2, 3]
Explanation 1:
1 is only present in A. 2 is present in A and B. 3 is present in B and C.
Explanation 2:
All numbers are present in atleast 2 out of 3 lists.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.