Limited Time Offer:30% off Hello Interview Premium 🎉

Back to Main

Learn DSA

Introduction

Two Pointers

Overview

Container With Most Water

3-Sum

Triangle Numbers

Move Zeroes

Sort Colors

Trapping Rain Water

Sliding Window

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Intervals

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Stack

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Overview

Daily Temperatures

Largest Rectangle in Histogram

Linked List

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Binary Search

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Heap

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Breadth-First Search

Introduction

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Backtracking

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Graphs

Overview

Course Schedule

Course Schedule II

Dynamic Programming

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Greedy Algorithms

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Trie

Overview

Implement Trie Methods

Prefix Matching

Prefix Sum

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Matrices

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Pricing

Become a Coach

Pricing Become a Coach

Get Premium

Two Pointers

Move Zeroes

easy

Watch Video Walkthrough

Watch a video walking through the coding problem step-by-step

Watch Video Walkthrough

Watch a video walking through the coding problem step-by-step

DESCRIPTION (credit Leetcode.com)

Given an integer array nums, write a function to rearrange the array by moving all zeros to the end while keeping the order of non-zero elements unchanged. Perform this operation in-place without creating a copy of the array.

Input:


nums = [2,0,4,0,9]

Output:


[2,4,9,0,0]

💻 Desktop Required

The code editor works best on larger screens. Please open this page on your computer to write and run code.

"Write a function that moves all zeroes in an integer array `nums` to the end of the array while maintaining the relative order of the non-zero elements."

Run your code to see results here

Have suggestions or found something wrong?

Explanation

We can solve this problem by keeping a pointer i that iterates through the array and another pointer nextNonZero that points to the position where the next non-zero element should be placed. We can then swap the elements at i and nextNonZero if the element at i is non-zero. This way, we can maintain the relative order of the non-zero elements while moving all the zeroes to the end of the array.

Solution


def moveZeroes(nums):
  nextNonZero = 0
  for i in range(len(nums)):
    if nums[i] != 0:
      nums[nextNonZero], nums[i] = nums[i], nums[nextNonZero]
      nextNonZero += 1

move zeros

0 / 13

Next: Sort Colors

Your account is free and you can post anonymously if you choose.

Sort By

Two Pointers

Move Zeroes

Watch Video Walkthrough

Watch Video Walkthrough

DESCRIPTION (credit Leetcode.com)

💻 Desktop Required

Explanation

Solution

Questions

Learn

Links

Legal

Contact