Code RoomMerge sorted arrays
EasyPrep Room Coding #1617

Merge sorted arrays

CodingAlgorithms & data structuresEntry–Mid~15 min

Merge two sorted integer arrays into one sorted array and return it.

Implement
merge_sorted(a: list[int], b: list[int]) → list[int]
Examples
in[[1,3,5],[2,4,6]]out[1,2,3,4,5,6]
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 15 min
InputExpectedGot
[[1,3,5],[2,4,6]][1,2,3,4,5,6]not run yetsample