Remove Duplicates from sorted Array

Remove Duplicates from sorted Array. Remove multiple occurrences of an element from array. Keep only one occurrence of each element. No multiple copies. Write a program to do this.

[@muthushankar570]

I was searched this problem in many websites not get this problem..but i see this problem in ur channel to understand very easily and learn clearly... Thank u brother 🙏

[@babarsk8784]

jai bolo chatgbt 😅

[@madhukumar1238]

Thank you!!! very well explained!! wish we had a professor like you!!!

[@sinebiinnazo7882]

I love how made the solution looked very simple. I wish you can treat more basic Java Algorithms so that i can understand several approaches to solving algorithms.

[@SmartProgramming]

awesome explanation sir, hats off, keep uploading, thank you 👍👍👍👍🙂🙂🙂🙂

[@Gaurav-bv6xr]

sir take all interview probelms from geeksforgeeks and dicuss their algorithm and complexity

[@sahad_abd]

Plz help me bro... I have to prepare for placements plz tell where should I refer

[@Gaurav-bv6xr]

@@sahad_abd bro,i am not preparing for interview now😅

[@sahad_abd]

@@Gaurav-bv6xr plz suggest me brooo..just you know

[@Gaurav-bv6xr]

@@sahad_abd prepare interview ques from geeksforgeeks

[@tanujvishwakarma1967]

wow i watched so many video but no buddy explained to butter and not cover to all every concept but u clear all the concept all and i"m surprise i means wow ; I"m say to thank u to u " sat sat naman app ko Hindi me bole to "

[@azad1300]

Your way of teaching is awesome. we need more problems solution on array, so update with some more problems.

[@Ihabkhattab]

Thank you bro for your visualization of the problem and the solution is awesome. finally, I got it 🙏🏿

[@mr.unique4974]

Thank you Sir for helping . I've been searching a lot for the logical explanation.

[@godwincharan]

The last line causes ambiguous behaviour if there is no element in the array. i.e. the size of the array is zero. Also using constant space method the final array will be 1,2,3,4,3,3,4,4 as we are using the same array and we don't clear the memory for those.

[@therealsayanroy]

it's for sorted array

[@samiahmadkhan2865]

You didn't get his point. He's right, you will need to remove the remaining elements from the array after Jth position

[@mepsk]

Exactly.. I have tried.. the last elements remain in array..

[@tonmoyrakshit1717]

That's right! We need to run a loop from jth+ 1 index till the last (n-1) and clear the remaining elements of the array.

[@sairamgamidi7786]

@@tonmoyrakshit1717 Can u give the code to clea remaining elements

[@FlavortownFreddy]

Very well explained, even small details are touched that others missed

[@mahideeptumati]

One doubt here. While using same array to avoid duplicates j ended up with 3 here , then what happened to elements present in index 4,5,6,7 of array arr as we didn’t remove them in that array

[@gokulnathnallaiya7617]

print array from 0 to j

[@champion5946]

@@gokulnathnallaiya7617 thanks buddy

[@nandiniprakash5191]

Very much helpful and can understand by anyone as explanation is very simple . Expecting to see the videos for java collections problems.

[@abhishek_singh512]

Nice lecture sir keeping uploading this type of conceptual video 🥰🥰🥰🥰🙏🙏🙏🙏🙏🙏 Maja aa gaya 🙂

[@ManishaKumari-yv3nf]

Your explanation technique is great 👍

[@tapanjeetroy8266]

Thanks for uploading it.. You are doing a great great job.. Please please upload more of such programming questions.. We really need it

[@naboulsikhalid7763]

what a quality explanation!. big thanks for the effort

[@jayashreeanitha4438]

Nice explanation sir .. well done .. Thank u so much for crystal clear explanation👍

[@xiangwingrace8672]

Very Good! Please discuss more complicated problems from GeeksforGeeks.

[@indianinvestor1301]

sir really good and help me a lot

[@samiahmadkhan2865]

You may want to slice of all the elements after j index, since you are doing in place replace.

[@ganeshshetty8441]

correct, Even i have commented the same

[@nitinfudani1552]

Liked the way you explained! Really Helpful.

[@PradeepSingh-ov3bt]

make these kinds of tricky questions which provide best solution for a particular problem

[@Vithal_Nivargi]

Thank you well explained

[@bassantdiaaahmed5736]

thank you so mush you are brilliant and you have such a beautiful method of teaching

[@caiomartins7807]

Very good lesson !!

[@user-youyoki9054]

I feel sorry to say, but I wasn't able to get the result as you explained on the video(even though I have written the code as yours).

[@crodr001]

There is an error in his explanation at least on the O(1). It should be a difference between the array his looping through AND a new array. He treating All as the same array.

[@gavravdhongadi9824]

You need to start the loop from I=0;I

[@amarjeetkurmi1302]

Very simple explanation sir

[@avibm948]

Thanks for the video. Something is missing at the end for the "in memory" case , test [1,2,3,3] you need to add at the end while j

[@NaturalPro100]

Great explanation sir ,but one small problem ,if the last element in the original array is duplicate to second last element in array ,then we have to check if arr[j] != original[n-1]

[@algorithmsguide5076]

Agreed !!

[@sdani9160]

No you are wrong if last 2 elements are duplicate it will not consider the 2nd last element and it will get out of the loop and finally insert the last element in new array

[@vivekdongare2289]

@@sdani9160 yes correct it will not take any of the duplicates from ending array

[@shubhamathawale7296]

Thank you sir 🙏 everything is clear now

[@MAHESHAITBECS]

good explanation sir

[@GG-hk5iz]

Very Well Explained .Thanks a lot

[@04.nehalsingh12]

awesome tutorial sir

[@aayushsarna6017]

Hi Vivek, What is the total time complexity for both the solutions. I believe that initially sorting the array will also take some time. So in this case can you please explain?

[@Lucy-dh2wj]

Very clear and understandable! thanks!

[@saadmanahmed860]

sir...in constant space method, u churn out output to be [ ]{ 1, 2 ,3 ,4}... but according to your expounded algorithm, output comes out to be [ ]{1,2,3,4, 3,3,4,4 } as deletion of redundant 3,3,4,4 never undergoes....plz explain???????????

[@algorithmsguide5076]

same doubt

[@shalinsitwala]

Since you know j=3, which means first 4 are distinct elements. So you can use your unique values in the array by for(int i = 0; i

[@Abhaykumar-lw7nr]

thanks brother amazing...

[@gawarivivek]

Thanks a lot, Sir!! Simplified explanation..:)

[@deepak-lv4vn]

you are completely ossum sir!!

[@laragarg]

Very helpful. Thank you very much.

[@ramindersonu]

Very good explanation

[@sanjayd9675]

#include void main(){ int n=8; int a[8]={1,2,2,3,3,3,4,4}; int j=0; for(int i=0 ; i < n-1 ; i++){ if(a[i]!=a[i+1]){ a[j]=a[i]; j++; } } a[j]=a[n-1]; for(int i=0 ; i < j+1 ; i++){ printf("%d" , a[i]); } } i think this works fine while printing we have to go till j+1 and not n when we do so we get the correct output but is there anyother method .

[@vidhyapriyadharsinicoimbat4352]

Awesome Explanation thank you sir

[@wmpah]

very clear and good writing on whiteboard

[@mohammad-karbalaee]

you are the loveliest indian ever.

[@GLTALES]

We kept i

[@babarsk8784]

i

[@akhint4379]

Thank you so much sir❤

[@JadeMelody08]

Great explanation. Thanks!

[@menkamenka661]

its really very helpful..Thanks

[@sunainagandra2924]

thank you sir..please post more..we will be very thakfull sir

[@malia8693]

great explanation!

[@hanschaudry808]

shout out to you bro, I hope someone posted you on national boyfriend day

[@hariprasad1744]

In the first approach zeros will be added at the end of the temp array as we are creating with the same size of the actual array. and int he second approach you didnt explain how to remove the last elements. Can you please add the code for the above in your git

[@suryanshtaragi794]

// use j++ to store last element //c programe to remove the duplicates elements #include void remove_duplicate(int arr[],int n) //n=number of elements in an array { int j=0; //traversing element in an array for(int i=0; i

[@maheshAkkili]

Thank you

[@MohdSameer-rx9gj]

Thank you very much sir...

[@prasadmotupalli7638]

in first case the last element is 4 o/p becomes----1 2 3 4 4??

[@mamuntheman6543]

if the arr is 1 2 3 1 2 3 then its not able to find the duplicate that you discussed in the every last moment.

[@Vishal-yp3ol]

nice video thanks

[@dandanamado8785]

Thank you, I have a question sir what is the n-1 stands for inside the for loop? Thank you

[@MrMarkgyuro]

In this case we can not go to the last index. Because we can not compare it to the next index after it, that is a not existing index. We have to break out from the loop before we get to the last index. But we can handle the problem with transferring the last index's element to the new array. the basic method: the length of the array is represented by n. in this case n = 9, it means we have 9 elements. this helps us beacuse as you see indexes in the array are starting from 0 to n - 1. In our case, 0, 1, 2, 3, 4, 5, 6, 7, 8, note that 8 = 9 - 1 (n - 1). and this means that if we are the 8th iteration, we will go inside the if conditions body, but after the 8th (again, n - 1) we break from the loop.

[@jitendarsahani11]

Second last elements

[@Aaqibkhan-oy9fr]

Thank you sir

[@moodswingsoflife]

Thanks sir .. really helpful

[@vivekanandkhyade]

Thanks a lot

[@zaheershaikh7982]

Good explanation buddy, a just one quick question to you. What if the last value is 4 instead of 5 then?

[@dev_manish]

there is something wrong with this algo.... use arr[j++]=arr[i] and arr[j++]=arr[n-1]

[@doviche]

​@@dev_manish​, the algo is wrong!

[@joelonix5326]

Good work.really helpful

[@krishnareddyyerram4615]

i++ j++ will not execute if duplicate found. Sort is required to place duplicate side by side.

[@ganeshshetty8441]

Hi Vivek, Here one more step is needed to remove other elements from array from Jth position,

[@satish040]

Hi Vivek, Can you do the same using hash tables. I am interested in known how to effectively create the hash function so that we dont have a large hashvalue. also how to avoid clash. Ex 0%20 is 0 and 20%20 is 0so using modulo is not that effective way of creating hash.

[@ranjithparuchuri7326]

nicely explained.thanks

[@Kidsgyan762]

Sir nice explanation

[@rajeshdevan6051]

Very nice Sir thank you

[@SubhashisDuttahere]

thanks a lot

[@techfusionwithamit]

thanks'

[@Kumarvivek-uv5hf]

the Solution does not work for constant space arr= [1,1,2] as J value remains 1 and hence when we want to print the array form 0 to j it will fail.

[@shubhamvds9697]

Very nice

[@TheMihirpatel23]

Thank you so much sir

[@kanimozhiparivallal995]

Super class....

[@ryanafzal4129]

Can anybody explain what is the time complexity of this algorithm?

[@praveenpuri2208]

what about 1,2,2,3,3,1,4,4.... can we apply this algo in situation?

[@jabraham1059]

if we keep modifying the same array will the size of the array change?

[@anilnkhsatriya9047]

Hi Vivek, pls explain, how to remove the eliments of linked list which is having sum is equals to zero

[@helloyou4233]

good quality education.

[@aokreddy920]

Nice explain sir

[@gurunatharudhbhandarkavath7781]

sir If the duplicates are not in consecutive then what we have to do?

[@diptiranjanrout7119]

thanks sir

[@makkerere4734]

well done

[@ekramdayan3800]

great video keep it up buddy

[@nidhisingh7802]

Sir also tell complexity in each case .

[@9441571873]

//Remove duplicates from Array let arr = [1,2,3,2,4,3,5]; let res = getResult(arr); function getResult(arr){ let obj = {}; let res = []; for(let i=0;i

[@yogeshsomasundaram4187]

Thank you. But one doubt In using extra space, what if the last element is 4 ( instead of 5 in the original array). Then the temp array would end up having 4 twice - pls correct me if I am wrong. Thank you for your help.

[@venkataramana7272]

replace i

[@thalabloods2514]

sir I tried it was awesome but getting array elements from user input is not working please upload video from getting user input and then remove duplicate

[@susannaventafridda430]

correct in place solution: def remove_duplicates(nums): j = 0 for i in range(len(nums) - 1): if nums[i] != nums[i + 1]: nums[j + 1] = nums[i + 1] j += 1 return j + 1

[@janispaloma6060]

What if the duplicate of 2 is place on the last place on array list

[@durjaarai7737]

Janis Paloma - hi, the question n solution is on sorted array.

[@dipankarpal686]

Your explanation is nice. But you are not checking for last element. if Last element is unique , your program will not work..

[@shahrukhshaikh9558]

I think we have to add arr[j++] =arr[n-1] if last two elements of array are same in constant space method

[@RTX_valorant]

Why can't we use just list(set(arr))???

[@santhuravikanti4988]

but if we use same array after filling the elements into array ,still will get duplicates after the loop in above example after filling the elements the index j is point to 3 and elements are filtered ,but if we display the array will get all elements after index 3 also,is this expected behavior

[@kavithagorantla6000]

Sir output kuda print cheyyochu kadha sir

[@yasmeenkarachiwala9612]

Amazing!

[@lailasanthi7598]

If last element and before element are equal what is the code sir