## DEV Community is a community of 554,041 amazing developers

We're a place where coders share, stay up-to-date and grow their careers.

# Day-4 Squares of a sorted array

The below solution is to the problem present in Leetcode's Introduction to Data Structures Array-101 part.

##### Problem Statement

Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.

##### Example 1
``````Input: [-4,-1,0,3,10]
Output: [0,1,9,16,100]
``````
##### Example 2
``````Input: [-7,-3,2,3,11]
Output: [4,9,9,49,121]
``````
##### Solution Approach
1. Iterate over the list.
2. Calculate the square of each element.
3. Append the squares of each element to a new list.
4. Sort and return the new list.
``````class Solution:
def sortedSquares(self, A: List[int]) -> List[int]:
square_elements = []
for item in A:
prod = item*item
square_elements.append(prod)
square_elements.sort()
return square_elements
``````

NOTE - Leetcode has a skeleton structure for codes that uses classes.