Task – Move All Negative Elements to the End (Maintain Order)

The task requires moving all negative elements in an unsorted array to the end while preserving the relative order of both positive and negative elements. The approach uses two auxiliary lists to separately collect positives and negatives, then overwrites the original array with positives first followed by negatives, achieving O(n) time and O(n) space complexity.