Merge Two Sorted Arrays | Dataford Interview Questions

Given two sorted integer arrays arr1 and arr2, write a function that returns a new sorted array containing all elements from both arrays. The input arrays are already sorted in non-decreasing order, and duplicate values should be preserved in the result.

Constraints

0 <= len(arr1), len(arr2) <= 10^5
-10^9 <= arr1[i], arr2[i] <= 10^9
Both input arrays are sorted in non-decreasing order

Function Signature

def merge_sorted_arrays(arr1, arr2):

Your question is Merge Two 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

Constraints

0 <= len(arr1), len(arr2) <= 10^5
-10^9 <= arr1[i], arr2[i] <= 10^9
Both input arrays are sorted in non-decreasing order

Function Signature

def merge_sorted_arrays(arr1, arr2):

Your question is Merge Two 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.