You have two arrays A and B, of size N and M, both are in sorted order [minimum to maximum]. You may have unique and duplicate integer values in both arrays. You have to combine both arrays in sorted order in another array C of size N+M. How you can combine these arrays as follow An integer value that is available in both arrays can be considered 1 – value unique in both arrays, transfer both values, A first then B 2 – value not unique in both arrays, transfer from the array where it occurs less number of time You can traverse both arrays for twice at max. ?(? + ?). No extra array, no counting Just for example A = {-2, -2, 3, 4, 4, 11, 13, 13, 17, 18, 21, 21, 21, 23, 23, 32, 41, 55, 55, 55} B = {-1, 4, 7, 8, 10, 11, 13, 17, 19, 19, 19, 21, 21, 32, 41, 49, 53, 55, 55, 55} C array at the end C = {4, 11, 11, 13, 17, 17, 21, 21, 32, 32, 41, 41, 55, 55, 55}
You have two arrays A and B, of size N and M, both are in sorted order [minimum to maximum]. You may have unique and duplicate integer values in both arrays. You have to combine both arrays in sorted order in another array C of size N+M.
How you can combine these arrays as follow
An integer value that is available in both arrays can be considered
1 – value unique in both arrays, transfer both values, A first then B
2 – value not unique in both arrays, transfer from the array where it occurs less number of time
You can traverse both arrays for twice at max. ?(? + ?). No extra array, no counting
Just for example
A = {-2, -2, 3, 4, 4, 11, 13, 13, 17, 18, 21, 21, 21, 23, 23, 32, 41, 55, 55, 55}
B = {-1, 4, 7, 8, 10, 11, 13, 17, 19, 19, 19, 21, 21, 32, 41, 49, 53, 55, 55, 55}
C array at the end
C = {4, 11, 11, 13, 17, 17, 21, 21, 32, 32, 41, 41, 55, 55, 55}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
