Ascending squares

Question

Ascending squares Given an integer array arr that is sorted in non-decreasing order, write a function to find and return an array of squares of each number sorted in non-decreasing order. Example 1 > - **Input:** arr = [-4, -2, 1, 3] > - **Output:** [1, 4, 9, 16] > - **Explanation:** Above is the sorted array of squares. Example 2 > - **Input:** arr = [-6, -5, -5] > - **Output:** [25, 25, 36] > - **Explanation:** Above is the sorted array of squares. Example 3 > - **Input:** arr = [1, 2, 3] > - **Output:** [1, 4, 9] > - **Explanation:** Above is the sorted array of squares.

Accepted Answer

Optimal Solution: Time Complexity O(N), Space Complexity O(1). Codeintuition provides an interactive coding environment for this problem.