Leetcode 977. Squares of a Sorted Array

Given a non-decreasing integer array (which may contain negatives), return the squares of each number in non-decreasing order; the core challenge is to produce this in O(n) time by leveraging the input order (e.g., merging largest squares from both ends) instead of re-sorting.