. Day 8 - Challenge 2 - Move Zeroes to the End Skip to main content

Day 8 - Challenge 2 - Move Zeroes to the End

Moving Zeroes to the End: A JavaScript Solution

Introduction: 

When working with arrays, there are often times when we need to manipulate their elements to achieve a specific goal. One common problem is moving all zeroes to the end of an array while keeping the order of non-zero elements unchanged. In this blog post, we will explore an elegant solution to this problem using JavaScript. We'll discuss the problem statement, the approach we'll take, and provide a step-by-step guide to implementing the solution.

The Problem: 

Given an array of integers, the task is to move all zeroes to the end of the array while maintaining the relative order of the non-zero elements. This means that after rearranging the array, all the zeroes should be at the end, and the order of the non-zero elements should remain the same.

The Approach: 

To solve this problem, we can utilize a two-pointer approach. We'll maintain two pointers, one for iterating through the array and another for keeping track of the position where the next non-zero element should be placed. As we iterate through the array, we'll swap the current element with the element at the non-zero pointer if the current element is non-zero. This way, we gradually push all non-zero elements to the front of the array. After iterating through the entire array, all non-zero elements will be in the desired order at the beginning, and we can simply fill the remaining positions with zeroes.

The JavaScript Solution: 

Let's implement the above approach in JavaScript:

function moveZeroesToEnd(arr) {
    let nonZeroPointer = 0;

    for (let i = 0; i < arr.length; i++) {
        if (arr[i] !== 0) {
            // Swap current element with element at non-zero pointer
            let temp = arr[i];
            arr[i] = arr[nonZeroPointer];
            arr[nonZeroPointer] = temp;

            nonZeroPointer++;
        }
    }
}

// Example usage
const inputArray = [0, 2, 0, 4, 0, 6, 8];
moveZeroesToEnd(inputArray);
console.log(inputArray); // Output: [2, 4, 6, 8, 0, 0, 0]

Explanation: 

In this solution, we iterate through the array and whenever we encounter a non-zero element, we swap it with the element at the position specified by the nonZeroPointer. This ensures that all non-zero elements are moved to the front of the array while maintaining their relative order. Finally, any remaining positions are filled with zeroes.

Demo:

Move Zeroes to the End Demo

Output Array:

 

Conclusion: 

Moving zeroes to the end of an array while keeping the order of non-zero elements intact might seem challenging at first, but with the two-pointer approach, we can achieve this efficiently. The JavaScript solution provided above demonstrates how this can be implemented. This technique not only solves the problem but also showcases the elegance and versatility of algorithms and data manipulation in programming.

Now write the same program in your favorite language in comment section. 

Other Challenges:

  1. Day 5 Challenges
  2. Day 6 Challenges 
  3. Day 7 Challenges

 

Labels:

Comments

Post a Comment

Popular posts from this blog

Day 9 - Challenge 1 - Product of Array Except Self

Solving the "Product of Array Except Self" Problem in JavaScript Are you ready to dive into a common coding challenge that not only tests your programming skills but also sharpens your problem-solving mindset? If you're up for the challenge, let's tackle the "Product of Array Except Self" problem together using JavaScript. This problem requires us to return an array where each element at index i is the product of all the elements in the original array except the one at index i . Understanding the Problem:   Imagine you're given an array of integers, let's call it nums . Your task is to create a new array where the value at index i in this new array is the product of all the elements in nums , except the one at index i . In other words, you're calculating the product of all the elements to the left of nums[i] and the product of all the elements to the right of nums[i] , and then multiplying these two products to get the final value at index i ...
Post a Comment
Read more

Day 9 - Challenge 2 - Reverse Linked List

Reversing a Singly Linked List in JavaScript: An In-Place Approach Introduction:   Singly linked lists are fundamental data structures in computer science that consist of a sequence of nodes, each containing data and a reference to the next node in the list. Reversing a singly linked list is a classic problem that challenges programmers to manipulate pointers effectively to achieve the desired outcome. In this blog post, we'll explore the problem of reversing a singly linked list using an in-place approach and provide a step-by-step solution in JavaScript. Problem Statement:   Given the head of a singly linked list, our task is to reverse the list in-place and return its new head. In other words, we need to modify the pointers of the nodes in such a way that the direction of the linked list is reversed. Solution Approach:   To solve this problem, we will iterate through the linked list while maintaining three pointers: previous , current , and next . The previous pointer...
Post a Comment
Read more