Remove duplicates from sorted array

https://www.youtube.com/watch?v=mp7c5CkWr4g

Welcome to another episode in our "Must Do Coding Interview Questions" playlist! In this video, I have coded for "Removing duplicates from a sorted array". Solving this coding problem is a great way to sharpen your DSA problem-solving skills.

First I have explained a brute-force solution to solve this problem statement. This involves using a map. Then I have explained a more optimal solution that makes use of 2-pointers. This problem statement is present in leetcode.

I'll be coding in Java, and by the end of this video, you'll have a deep understanding of these techniques and be well-prepared for your next coding interview.

This question has 2 variations. The easy variation is covered in this video and the 2nd variation is covered in the next video

This playlist will cover all the must-do interview questions for cracking the coding interview round (including for companies like Meta,/Facebook, Apple, Amazon, Netflix, and Google)

Don't forget to like, share, and subscribe for more coding interview tutorials!

Happy Coding :)

https://leetcode.com/problems/remove-duplicates-from-sorted-array/?envType=study-plan-v2&envId=top-interview-150

class Solution {
    public int removeDuplicates(int[] nums) {
        int i = 0;
        for (int j = 1; j < nums.length; ) {
            if(nums[i] == nums[j]){
                j++;
            }
            else{
                i++;
                nums[i] = nums[j];
            }
        }
        return i + 1;
    }
}

https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/

class Solution {
    public int removeDuplicates(int[] nums) {
        int n=nums.length;
        if(n<=2) return n;

        int i=2;
        for(int j=2;j<n;j++)
        {
            if(nums[j]!=nums[i-2])
            {
                nums[i]=nums[j];
                i++;
            }
        } 
        return i;  
    }
}