1
class Solution:
2
    def sortedSquares(self, nums: List[int]) -> List[int]:
3
        l, r = 0, len(nums) - 1
4
        pointer = 0
5
        arr = [0] * len(nums)
6
        pointer = r
7
        while l <= r:
8
            if abs(nums[r]) > abs(nums[l]):
9
                arr[pointer] = nums[r] ** 2
10
                r -= 1
11
                pointer -= 1
12
            else:
13
                arr[pointer] = nums[l] ** 2
14
                l += 1
15
                pointer -= 1
16

17
        return arr