Move Zeroes - CA13

My Thinking and Approach Introduction In this problem, I was given an array of integers and asked to move all zeroes to the end of the array. The important condition is that the relative order of non-zero elements should be maintained. Problem Statement Given an array of integers nums Move all 0’s to the end Conditions: Maintain relative order of non-zero elements Perform operation in-place Do not use extra space My Initial Thought At first, I considered: Creating a new array Adding all non-zero elements Then adding zeroes at the end But this approach uses extra space. Key Observation Instead of using extra space: I can shift all non-zero elements to the front Then fill the remaining positions with zeroes Optimized Approach I decided to use a pointer to track position of non-zero elements. Logic: Traverse the array Place non-zero elements at correct position Fill remaining positions with zeroes My Approach (Step-by-Step) Initialize a pointer pos = 0 Traverse the array: If element is no