Reorder Array by Sign | Dataford Interview Questions

A Veritas backup workflow uses signed integer priorities to classify work items. Reorder the given array so that every negative integer appears before every non-negative integer, while preserving the original relative order within both groups. Do not sort the values by magnitude.

Return a new array containing the same values. The input array may be modified, but modification is not required.

Formal Specification

Implement stable_partition_priorities(nums), where nums is a list of integers. Return a list containing all values from nums in stable partition order:

Negative values, in their original order.
Zero and positive values, in their original order.

The output must contain exactly the same number of occurrences of every value as the input.

Constraints

0 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9
Duplicate values are allowed
Zero belongs to the non-negative group
The output must preserve relative order within both groups

Function Signature

def stable_partition_priorities(nums):

Your question is Reorder Array by Sign. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem