Given two arrays, one with m sorted elements and another of size m+n containing n sorted elements at the beginning where the last m positions are empty, write code to merge these two sorted arrays efficiently so that you have all the sorted elements of the two arrays in the bigger array.

Question

Accepted Answer

Merge two sorted arrays efficiently into a bigger array.

Use a two-pointer approach to compare and merge elements from both arrays.
Start from the end of the bigger array and move backwards to avoid overwriting elements.
Continue merging until all elements from both arrays are placed in the bigger array.