Moves Zeroes

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array. Example 1: Input: nums = [0,1,0,3,12] Output: [1,3,12,0,0] Example 2: Input: nums = [0] Output: [0] Constraints: 1 <= nums.length <= 104 -231 <= nums[i] <= 231 - 1 SOLUTIONS: Move Zeroes (LeetCode 283) – Optimal In-Place Approach Problem Statement Given an array nums, move all 0s to the end while maintaining the relative order of non-zero elements. The operation must be done in-place No extra array should be used Key Idea: Two Pointers This solution uses two pointers: l tracks the position where the next non-zero element should be placed r iterates through the array Whenever a non-zero element is found at index r, it is swapped with the element at index l, and l is incremented. Code Implementation Writing class Solution: def moveZeroes(self, nums: List[int]) -> None: l = 0 for r i