Tap here to switch tabs
Problem
Ask
Submissions
Problem: Squares of a Sorted Array
15 min
Explore how to apply the two pointers approach to transform a sorted integer array by squaring its elements and maintaining sorted order. Understand the problem constraints and develop a solution that handles edge cases efficiently, preparing you for coding interview challenges.
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
⋮
Tap here to switch tabs
Problem
Ask
Submissions
Problem: Squares of a Sorted Array
15 min
Explore how to apply the two pointers approach to transform a sorted integer array by squaring its elements and maintaining sorted order. Understand the problem constraints and develop a solution that handles edge cases efficiently, preparing you for coding interview challenges.
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.