How should I practice Sort an Absolute-Value-Sorted Linked List?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP onsite interview problems in FastPrep.

Is Sort an Absolute-Value-Sorted Linked List associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP onsite interview coding practice problem when the problem catalog has that company and stage context.

Sort an Absolute-Value-Sorted Linked List

Bloomberg LP● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

A singly linked list is sorted by nondecreasing absolute value. Rearrange its existing nodes so their integer values are in ordinary nondecreasing order and return the new head.

Function

sortAbsoluteList(head: ListNode) → ListNode

Examples

Example 1

head = [1,-2,-3,4,-5]return = [-5,-3,-2,1,4]

Negative nodes reverse magnitude order before the positive nodes.

Example 2

head = [-1,-2,-3]return = [-3,-2,-1]

All negative nodes reverse.

Constraints

The list has at most 10^5 nodes.
Absolute values are nondecreasing along the input list.