In-Place Merging of Sorted Arrays | Dataford Interview Questions

Merge Sorted Array (LeetCode 88): merge two sorted arrays in place.

Asked in the phone screen stage. Easy LeetCode question asked first.

Contract

Implement merge(nums1, m, nums2, n). nums1 contains m sorted values followed by n empty buffer positions, and nums2 contains n sorted values. Modify nums1 in place so it contains all m + n values in nondecreasing order, then return nums1.

Constraints

0 <= m, n <= 200
m + n == len(nums1)
len(nums2) == n
-10^9 <= nums1[i], nums2[i] <= 10^9
nums1[:m] and nums2 are sorted in nondecreasing order

Function Signature

def merge(nums1, m, nums2, n):

Your question is In-Place Merging of Sorted Arrays. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem