Day 1 – Move Zeroes | Two Pointer Approach | LeetCode Challenge

🗓️ Date: July 25, 2025

---

📌 Challenge:

🧩 Problem: Move Zeroes – LeetCode #283 (Easy)
💻 Topic: Arrays, Two Pointers

---

✅ Problem Statement (Summary):

Move all zeroes in an array to the end while maintaining the relative order of the non-zero elements.
Example:
Input: [0,1,0,3,12] → Output: [1,3,12,0,0]
Constraints: Must do it in-place with minimum operations.

---

🧠 What I Learned Today:

• The Two Pointer approach is perfect when reordering in the same array.

• Learned how to use one pointer for traversal and one to track non-zero insert positions.

• Optimized in-place swaps instead of using extra space.

---

🧪 Code (C++):

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int  e = 0;
       for(int s=0;s<nums.size();s++) {
            if (nums[s] != 0) {
                swap(nums[s], nums[e]);
                e++;
            }
        }
    }
};

🕒 Time Complexity: O(n)
📦 Space Complexity: O(1)

---

📸 LeetCode Submission Screenshot:

---

📈 Progress Tracker:

• ✅ Day: 1 / 30

• 🧩 Total Problems Solved: 1

• 🧭 Focus Today: Two Pointers

---

🗂️ Tags:

#leetcode #30DaysChallenge #twopointers #dsa #c++ #codingjourney #array