Problem
Ask
Submissions
Problem: Squares of a Sorted Array
Easy
15 min
Explore how to transform a sorted integer array into a sorted array of their squares using the two-pointer approach. Understand the problem constraints and learn to implement a solution with linear time complexity to efficiently handle large datasets.
Statement
You are given an integer array, nums, sorted in non-decreasing order. Your task is to return a new array containing the squares of each number, also sorted in non-decreasing order.
Constraints:
nums.lengthnums[i]numsis sorted in non-decreasing order.
Examples
Understand the problem
Figure it out!
Try it yourself
⋮
Problem
Ask
Submissions
Problem: Squares of a Sorted Array
Easy
15 min
Explore how to transform a sorted integer array into a sorted array of their squares using the two-pointer approach. Understand the problem constraints and learn to implement a solution with linear time complexity to efficiently handle large datasets.
Statement
You are given an integer array, nums, sorted in non-decreasing order. Your task is to return a new array containing the squares of each number, also sorted in non-decreasing order.
Constraints:
nums.lengthnums[i]numsis sorted in non-decreasing order.