Problem Statement Given two sorted arrays arr1[] and arr2[] of sizes n and m in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains t...
balaji-dsa.hashnode.dev4 min read
No responses yet.