merging two sorted arrays in C++ in special manners

[hamzamehmood67]

You're given two sorted arrays. You have to merge them in this manner that if there are some same elements in both of them the third merging array should have less number of same elements. For example: Arr1= 1 5 5 5 6 6 7 7 Arr2= 2 5 5 6

output= 1 2 5 5 6 7 7 There are two 5's because in one array there are three 5's and in second array there are two 5's. So we should always take less number.

[welcome[bot]]

Thanks for opening your first issue here! Be sure to follow the issue template!

[nitish155941]

could you assign it to me.

[hamzamehmood67]

could you assign it to me.

Start working on it don't wait for assign

[agastya3636]

could you assign it to me

[prateek-narsinghani]

@hamzamehmood67 please have a look at this PR: https://github.com/MakeContributions/DSA/pull/1278 Since I am new to open source please let me know if I missed anything