//The easiest solution to this is to have a new array at length n+m and overwrite nums1 after we do all the comparisons. //Awesome, this solution beats 100% on my first submission. Though I the brute ...

https://leetcode.com/explore/challenge/card/december-leetcoding-challenge/571/week-3-december-15th-december-21st/3567/ Given an integer array nums sorted in non ...