Algorithm Practice: 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:

Solution:

var sortedSquares = function(nums) {
let arr=[]
let left = 0
let right = nums.length -1

for(let i = nums.length -1 ; i >= 0 ;i--){
let square
if(Math.abs(nums[left]) < Math.abs(nums[right])){
square = nums[right]
right --
} else{
square = nums[left]
left++
}
arr[i] = square* square
}
return arr
//Brute force // for(let i = 0; i < nums.length ; i++){
// arr[i] = nums[i] * nums[i]
// }
// return arr.sort((a,b) => a-b)
};

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store