Shifting Non-Zero Values Left: A Common Array Interview Problem-1

Introduction

In technical interviews, array manipulation problems are frequently encountered. In this post, we’ll tackle a common problem: Shifting non-zero values to the left while maintaining the order of non-zero elements and pushing all zeros to the right.

If you're unfamiliar with basic array concepts, I recommend checking out Understanding Array Basics in Java: A Simple Guide to get up to speed!

Problem Statement

Given an array of integers, your task is to move all non-zero elements to the left side while pushing all zero elements to the right. The relative order of the non-zero elements must be preserved.

Example:

Input:  [1, 2, 0, 3, 0, 0, 4, 3, 2, 9]
Output: [1, 2, 3, 4, 3, 2, 9, 0, 0, 0]

Approach

We can solve this problem in O(n) time using a single pass through the array, and the solution will have a space complexity of O(1).

1. Use a pointer to track the index for the next non-zero element.
2. Iterate through the array, placing non-zero elements at the pointer's index.
3. Increment the pointer each time a non-zero element is placed.

The Code

package arrays;

// Time Complexity - O(n)
// Space Complexity - O(1)
public class ShiftNonZeroValuesToLeft {

    private void shiftValues(int[] inputArray) {

        /* Variable to keep track of index position to be 
                   filled with Non-Zero Value */ 
        int pointer = 0;

        // If value is Non-Zero then place it at the pointer index
        for (int i = 0; i 



<h2>
  
  
  Explanation
</h2>

• The shiftValues method iterates through the input array.

• If a non-zero value is found, it is placed at the current pointer index, and the element at the current index is replaced with 0.

• The pointer is then incremented to track the next position for a non-zero element.

• If there is already a non-zero value at the correct position (i.e., at the pointer index), the method simply increments the pointer without making any swaps.

• This continues until the entire array is processed.

Time & Space Complexity

• Time Complexity: O(n), where n is the length of the array.

• Space Complexity: O(1), since we’re modifying the array in place.

Edge Cases

• All Zeros: If the array contains all zeros, it will remain unchanged.

• No Zeros: If there are no zeros, the original order of elements is preserved.

• Empty Array: The function should handle empty arrays without issues.

Conclusion

This problem showcases the importance of understanding array manipulation techniques and their efficiency in coding interviews. Mastering such problems can greatly enhance your problem-solving skills!

The above is the detailed content of Shifting Non-Zero Values Left: A Common Array Interview Problem-1. For more information, please follow other related articles on the PHP Chinese website!