Introduction

In this blog post, we will explore how to solve the LeetCode problem "283" using AI. LeetCode is a popular platform for preparing for coding interviews, and with the help of AI tools like Chatmagic, we can generate solutions quickly and efficiently - helping you pass the interviews and get the job offer without having to study for months.

Problem Statement

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 Follow up: Could you minimize the total number of operations done?

Explanation

Here's the approach to solve this problem:

• Two Pointers: Use two pointers, left and right. left points to the position where the next non-zero element should be placed, and right iterates through the array.
• In-Place Swapping: If nums[right] is non-zero, swap nums[left] and nums[right], then increment left. This ensures that all non-zero elements are moved to the beginning of the array in their original order.

• Remaining Elements: After iterating through the array, all non-zero elements will be at the beginning, and the remaining positions will be filled with zeros automatically because the swapping logic pushes zeros to the end.

• Runtime Complexity: O(n), Storage Complexity: O(1)

Code

    def move_zeroes(nums):
    """
    Moves all 0's to the end of the array while maintaining the relative order
    of the non-zero elements.

    Args:
        nums: A list of integers.
    """
    left = 0
    for right in range(len(nums)):
        if nums[right] != 0:
            nums[left], nums[right] = nums[right], nums[left]
            left += 1