Please enter your email address or userHandle.
Given two arrays a and b of size n and m respectively. The task is to find union between these two arrays.
Union of the two arrays can be defined as the set containing distinct elements from both the arrays. If there are repetitions, then only one occurrence of element should be printed in the union.
1 2 3 4 5
1 2 3
1, 2, 3, 4 and 5 are the
elements which comes in the union set
of both arrays. So count is 5.
85 25 1 32 54 6
85, 25, 1, 32, 54, 6, and
2 are the elements which comes in the
union set of both arrays. So count is 7.
Complete doUnion funciton that takes a, n, b, m as parameters and returns the count of union elements of the two arrays. The printing is done by the driver code.
1 ≤ n, m ≤ 105
0 ≤ a[i], b[i] < 105
Expected Time Complexity : O((n+m)log(n+m))
Expected Auxilliary Space : O(n+m)
We strongly recommend solving this problem on your own before viewing its editorial. Do you still
want to view the editorial?
Login to access your submissions.