-
Notifications
You must be signed in to change notification settings - Fork 754
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
merging two sorted arrays in C++ in special manners #1272
Comments
Thanks for opening your first issue here! Be sure to follow the issue template! |
could you assign it to me. |
Start working on it don't wait for assign |
could you assign it to me |
@hamzamehmood67 please have a look at this PR: #1278 |
13 tasks
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
The text was updated successfully, but these errors were encountered: