Geetanjali Mahobiya

Are you passionate about software engineering, coding, and the latest in tech? Look no further! On this channel, Stuck on a coding error or debugging issue? This channel is here to help! We provide quick and practical solutions to common programming errors, bugs, and debugging tips across languages like Java and more. Subscribe for bite-sized fixes and step-by-step troubleshooting to keep your code running smoothly! 💻




Geetanjali Mahobiya

Remove duplicate from sorted array ...
Approach
Optimized Approach (Two Pointers)
💡 Idea

Because the array is sorted, duplicates are always next to each other.

We maintain:

i → slow pointer (position of last unique element)

j → fast pointer (to scan array)

Whenever we find a new unique element, we move i forward and copy that element.

🧠 Algorithm Steps

If array length is 0 → return 0

Initialize i = 0

Loop j from 1 to n-1:

If nums[j] != nums[i]

Increment i

nums[i] = nums[j]

Return i + 1 (count of unique elements)

4 months ago | [YT] | 2

Geetanjali Mahobiya

Happy achievement 🎊

9 months ago | [YT] | 2

Geetanjali Mahobiya

Which of the following statement is correct about array?

1 year ago | [YT] | 0