A C++ Solution for Merge Without Using Extra Space (GFG-Hard)

[geekySapien]

💥 Proposal

Problem Statement: Given two sorted arrays arr1[] of size N and arr2[] of size M. Each array is sorted in non-decreasing order. Merge the two arrays into one sorted array in non-decreasing order without using any extra space.

Problem Statement Link : Link

Sample Test Cases:

Expected Time Complexity : O((n+m)*log(n+m)) Expected Space Complexity: O(1)

I would like to solve this issue in C++

Have you read the Contributing Guidelines on Pull Requests?

Yes

[github-actions[bot]]

Hello @geekySapien,
Thank you for opening an issue. :partying_face:
To get assigned to this particular issue please use /assign
Check this guide before contributing.

[github-actions[bot]]

STOMP !!

Sorry but You cannot have more than 2 issues open, kindly close or finish your current issues before you make a new one.

if you feel the issue is Important please tag a maintainer.

This action is being deployed to prevent spamming of issues,

If you are not spamming then you are doing a great work. Keep it up !!

[github-actions[bot]]

This issue has been assigned to @geekySapien! It will become unassigned if it isn't closed within 17 days. A maintainer can also add the pinned label to prevent it from being unassigned.