Skip to main content

9. Merge Sorted Array

easyAsked at Brex

Merge two sorted integer arrays in-place such that the result is also sorted.

By Alex Chen, Founder, InterviewChamp.AI · Last verified

Problem

You are given two sorted integer arrays nums1 and nums2 of sizes m+n and n. Merge nums2 into nums1 as one sorted array, in-place. The final result should not be returned but stored in nums1.

Constraints

  • nums1.length == m + n
  • nums2.length == n
  • 0 <= m, n <= 200

Examples

Example 1

Input
nums1 = [1,2,3,0,0,0], m=3, nums2 = [2,5,6], n=3
Output
[1,2,2,3,5,6]

Example 2

Input
nums1 = [1], m=1, nums2 = [], n=0
Output
[1]

Approaches

1. Concat and sort

Copy nums2 into nums1's tail then sort the whole array.

Time
O((m+n) log(m+n))
Space
O(1)
for(let i=0;i<n;i++) nums1[m+i]=nums2[i];
nums1.sort((a,b)=>a-b);

Tradeoff:

2. Three pointers from the back

Write largest first from the end so we never overwrite unread cells. Single pass and in-place.

Time
O(m+n)
Space
O(1)
function merge(nums1, m, nums2, n) {
  let i = m - 1, j = n - 1, k = m + n - 1;
  while (j >= 0) {
    if (i >= 0 && nums1[i] > nums2[j]) {
      nums1[k--] = nums1[i--];
    } else {
      nums1[k--] = nums2[j--];
    }
  }
}

Tradeoff:

Brex-specific tips

Brex extends this into merging settled and pending transactions on a per-card timeline, so be ready to talk about stability when two records share an authorization timestamp.

Solve it now

Free. No sign-up. Python and JavaScript run instantly in your browser.

Output

Press Run or Cmd+Enter to execute

Practice these live with InterviewChamp.AI

Drill Merge Sorted Array and other Brex interview questions under real-loop conditions with instant feedback on your reasoning, complexity claims, and code.

Practice these live with InterviewChamp.AI →