I wrote up two ways to approach this problem. The first, by making a copy of the first array, and pushing the merged/sorted numbers into the copied array. The second, by looping backwards from the end of the first array, finding the largest numbers first, and filling in the “0"s at the end of the array.
My code for this week is here
. I’ll be storing our weekly LC challenges in this repository.