Problem:
Move all 0s to the end of the array while maintaining the relative order of non-zero elements.
Approach Covered:
1. Brute force idea (extra array)
2. Optimized in-place solution using two pointers (l & r)
💡 Key Insight:
Whenever you find a non-zero element, move it to the next correct position.
⏱ Time Complexity: O(n)
📦 Space Complexity: O(1)
This is a very important problem for coding interviews and helps build strong intuition for array manipulation and two-pointer techniques.👍 If you found this helpful, like & subscribe for more DSA content!
