> For the complete documentation index, see [llms.txt](https://anton-veselskyi.gitbook.io/codding-problems-solutions/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anton-veselskyi.gitbook.io/codding-problems-solutions/leetcode/easy/squares-of-a-sorted-array.md).

# Squares of a Sorted Array

## [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array)

Given an integer array `nums` sorted in **non-decreasing** order, return *an array of **the squares of each number** sorted in non-decreasing order*.

**Example 1:**

```

Input: nums = [-4,-1,0,3,10]
Output: [0,1,9,16,100]
Explanation: After squaring, the array becomes [16,1,0,9,100].
After sorting, it becomes [0,1,9,16,100].
```

**Example 2:**

```

Input: nums = [-7,-3,2,3,11]
Output: [4,9,9,49,121]
```

**Constraints:**

* `1 <= nums.length <= 104`
* `-104 <= nums[i] <= 104`
* `nums` is sorted in **non-decreasing** order.

&#x20; **Follow up:** Squaring each element and sorting the new array is very trivial, could you find an `O(n)` solution using a different approach?

## Solutions

### 🧠 Cpp

```cpp
class Solution
{
public:
    vector<int> sortedSquares(vector<int>& A)
    {        
        multiset<int> sorted_squares;
        for(int num : A)
            sorted_squares.insert(num*num);

        return vector<int>(begin(sorted_squares), end(sorted_squares));
    }
};
```