Is Sort Array By Absolute Value easy or hard?

Sort Array By Absolute Value is generally classified as an Easy problem. The key idea is recognizing that the sorting condition depends on abs(x) rather than the number itself. Once you apply a custom comparator, the implementation becomes straightforward.

Sort Array By Absolute Value Python/Java solution

Python solutions typically call sort with key=abs. Java implementations use Arrays.sort with a custom Comparator that compares Math.abs(a) and Math.abs(b). The same idea applies in C++, Go, TypeScript, and Rust using their respective custom comparator features.

How to solve Sort Array By Absolute Value in O(n)?

An O(n) style approach is possible when the range of absolute values is limited. You can iterate through the array, group numbers into buckets keyed by abs(x), and then rebuild the array by scanning the buckets in order. The total complexity becomes O(n + k), where k is the range of absolute values.

What is the best approach for Sort Array By Absolute Value?

The best approach is custom sorting using a comparator that compares absolute values. Most languages allow a key function such as abs(x) or a custom comparator. This solution runs in O(n log n) time using the built-in sorting algorithm and requires minimal additional code.

Is Sort Array By Absolute Value asked at Google/Amazon/Meta?

Array sorting problems with custom comparators appear frequently in interviews at large tech companies such as Google, Amazon, and Meta. Variants test your ability to define custom ordering rules and apply built-in sorting efficiently.

What data structure is used in Sort Array By Absolute Value?

The main data structure is a simple array combined with a sorting algorithm. Some optimized variants use hash maps or bucket arrays to group numbers by their absolute values before reconstructing the sorted output.

What is the time complexity of Sort Array By Absolute Value?

The standard solution uses comparison-based sorting with a custom absolute-value comparator, which runs in O(n log n) time. Space complexity depends on the language implementation, typically O(1) to O(n). Alternative bucket-based solutions can achieve O(n + k) time when the absolute value range is small.

3667. Sort Array By Absolute Value - Practice Online

You are given an integer array nums.

Rearrange elements of nums in non-decreasing order of their absolute value.

Return any rearranged array that satisfies this condition.

Note: The absolute value of an integer x is defined as:

x if x >= 0
-x if x < 0

Example 1:

Input: nums = [3,-1,-4,1,5]

Output: [-1,1,3,-4,5]

Explanation:

The absolute values of elements in nums are 3, 1, 4, 1, 5 respectively.
Rearranging them in increasing order, we get 1, 1, 3, 4, 5.
This corresponds to [-1, 1, 3, -4, 5]. Another possible rearrangement is [1, -1, 3, -4, 5].

Example 2:

Input: nums = [-100,100]

Output: [-100,100]

Explanation:

The absolute values of elements in nums are 100, 100 respectively.
Rearranging them in increasing order, we get 100, 100.
This corresponds to [-100, 100]. Another possible rearrangement is [100, -100].

Constraints:

1 <= nums.length <= 100
-100 <= nums[i] <= 100