Move all negative elements to end

Introduction In many real-world problems, we need to rearrange elements based on conditions while maintaining their original order. This problem focuses on moving all negative numbers to the end of the array while keeping the order of both positive and negative elements unchanged. Problem Statement Given an unsorted array arr[] containing both positive and negative integers: Move all negative elements to the end Maintain the original order of: Positive elements Negative elements Do it in-place (no return needed) Examples Example 1: Input: [1, -1, 3, 2, -7, -5, 11, 6] Output: [1, 3, 2, 11, 6, -1, -7, -5] Example 2: Input: [-5, 7, -3, -4, 9, 10, -1, 11] Output: [7, 9, 10, 11, -5, -3, -4, -1] Intuition We need to: Keep positive numbers in front (same order) Push negative numbers to end (same order) This means we need a stable arrangement (order should not change). Approach Since order must be preserved, the best clean approach is: Create a temporary list First add all positive elements Th