POTD, merge without extra space.

[VipinDhakad]

void swap(long long arr1[], long long arr2[], int j, int k){
long long temp = arr2[j];
arr2[j] = arr1[k];
arr1[k] = temp;
return;
}
void merge(long long arr1[], long long arr2[], int n, int m)
{
int i=0, j=0, k=n-1;

        while(i<k && j<m){
            if(arr1[i]>arr2[j]){
                swap(arr1, arr2, j, k);
                k--;
                j++;
            }
            else i++;
        }
        sort(arr1, arr1+n);
        sort(arr2, arr2+m);
        return;
    } 

[getlost01]

Thanks for your solution idea.
I have tried to run your code but it is giving a WA

[VipinDhakad]

Thanks for reviewing, it's actually this condition -> (i<=k && j<m) in the while loop. I forgot to add a = sign while posting the answer here.

[getlost01]

Although your logic is correct, the problem still exists. This is because the problem states that to not use additional space, but your swap function uses a temporary variable temp multiple times(n times) in a loop for swapping.

By the way, this question is just complex because of these no extra space constraints else it is just a merge sort concept.

Thank you for reaching out and sharing your solution for diversifying solution ideas.