def sorted_squares(arr): #IPT
    # O(N) O(N)
    N = len(arr)
    squares = [0]* N
    l, r = 0, N-1
    s = N-1
    while l < r:
        leftSq, rightSq = arr[l]*arr[l], arr[r]*arr[r]
        if leftSq < rightSq:
            squares[s] = rightSq
            r -= 1
        else:
            squares[s] = leftSq
            l += 1
        s -= 1
    return squares