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

[geekySapien]

Description

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.

Link to the Problem Statement: Link

Test Case 1

Input:

N = 4, M = 5

arr1[] = {1, 3, 5, 7}

arr2[] = {0, 2, 6, 8, 9}

Output: 0 1 2 3 5 6 7 8 9

Explanation:

Since we can't use any extra space, modify the given arrays to form

arr1[] = {0, 1, 2, 3}

arr2[] = {5, 6, 7, 8, 9}

Test Case 2

Input:

N = 2, M = 3

arr1[] = {10, 12}

arr2[] = {5, 18, 20}

Output: 5 10 12 18 20

Explanation:

Since we can't use any extra space, modify the given arrays to form

arr1[] = {5, 10}

arr2[] = {12, 18, 20}

Sir, I can work on this issue and provide C++ solution for the same. Kindly Assign me this issue under LGM-SOC'21

[siddhi-244]

Can I try in python?

[Rounak-chauhan]

can i do in java?