Move All Negative Elements to End

Problem Statement Given an array arr[] containing both positive and negative integers, move all negative elements to the end of the array without changing the relative order of elements . My Thought Process At first, I thought this is similar to partitioning (like quicksort or two-pointer problems). But then I noticed an important constraint: The order of elements must not change. This changes the entire approach. If I try swapping elements (like placing negatives at the end using two pointers), the order of positive elements or negative elements may get disturbed. So I needed a way to rearrange elements while keeping their original sequence intact. Key Observation We are not asked to sort. We are only asked to: Keep all non-negative elements in the front (in the same order) Move all negative elements to the end (in the same order) This means the solution must be stable . MY way of Approach To maintain order, I used an extra array. Step 1: Create a temporary array This helps us rebuild