Photo by Florian Olivo on Unsplash

Day 3: Move Zeroes

Leetcode 75-day challenge

Day 1: Search in a Binary Search Tree

Day 2: Delete Node in a Binary Search Tree

So, the problem I chose to start for the third day is: Move Zeroes

Before I start explaining the solution to this problem, I assume that the reader of this blog has a basic understanding of how the two-pointer approach works. If not, you can watch a YouTube video on the topic here:

Let’s start:

The problem states that:

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.