Merge two sorted arrays in-place

Q: Merge two sorted arrays in-place

This is a Coding & Algorithms interview question from Meta for Machine Learning Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given two nondecreasing arrays A and B, where A has enough trailing empty slots to hold all elements of B. Merge B into A in-place so that A remains sorted. Describe and implement an algorithm that runs in O(m+n) time and O(

extra space, and argue correctness.

Merge two sorted arrays in-place

Comments (0)