Squares of a Sorted Array

Given an integer array sorted in non-decreasing order (which may contain negative numbers), return a new array of the squares of each number, also sorted in non-decreasing order. Aim for an O(n) solution by leveraging the sorted input — for example, by using a two-pointer approach to merge the largest squares from both ends of the array.