DATA STRUCTURES • ALGORITHMS

Move Zeroes

Shifting all zero elements to the end of an array while maintaining the relative order of all non-zero elements.

Time

O(N)

Space

O(1)

Key Principle 1

Two-pointer technique

Key Principle 2

Maintains stable order

Key Principle 3

In-place modification

Key Principle 4

Single-pass efficient

MOVE_ZEROES_LAB
ARRAY:
Current Step
Initialize write pointer at 0. Start reading.
Playback
Pointer State ⠿
READ0
WRITE0
Two-Pointer Logic ⠿
1int write = 0;
2for (int read = 0; read < n; read++) {
3    if (arr[read] != 0) {
4        swap(arr[read], arr[write++]);
5    }
6}
0
RD
1
[1]
0
[2]
3
[3]
12
[4]

Loading Lab...