The below solution is to the problem present in Leetcode's Introduction to Data Structures Array-101 part.
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.
Input: [-4,-1,0,3,10] Output: [0,1,9,16,100]
Input: [-7,-3,2,3,11] Output: [4,9,9,49,121]
- Iterate over the list.
- Calculate the square of each element.
- Append the squares of each element to a new list.
- 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.