Move Zeroes-CA13

My Thinking and Approach Introduction In this problem, I was given an integer array and asked to move all the 0 s to the end while maintaining the relative order of the non-zero elements. At first glance, it looked simple. But the constraint that the operation must be done in-place (without using extra space) made me think more carefully about the solution. Problem Statement Move all 0 s to the end of the array Maintain the order of non-zero elements Do it in-place (no extra array allowed) My Initial Approach Initially, I thought of a straightforward method: Create a new array Add all non-zero elements Then append all zeros at the end But this approach uses extra space, which violates the problem constraint. So I needed a more optimized solution. Optimized Approach (Two Pointer Technique) To solve this efficiently, I used the two-pointer approach . Idea Use one pointer i to traverse the array Use another pointer j to track the position where the next non-zero element should be placed S