Merge Sorted Arrays with Vacant Spaces
Filed under Visible Alpha
The question
Given two sorted arrays of size N and M (where N > M) and the first array has exactly M vacant spaces, fill the elements of the second array into the first array in O(N) time.
No write-up yet. Related questions below have one.
Related Visible Alpha questions
Collected from public candidate posts and coding forums. Updated Nov 2026.