There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). You may assume nums1 and ...

1. Separate negative and positive numbeqrs. 2. Square all elements. 3. Reverse the squared negative list. 4. Merge both sorted lists using two pointers.