Remove Duplicates From Sorted Linked List

[@samarthbhandari1360]

You're doing a fantastic job! Keep it up! You have helped me tackle my personal fear of working with linked lists

[@eng6070]

best teaching ever sir! very clear explanation with detailed coding, thank you very much sir, it help me a lot!

[@dipteshdeore5207]

You teach in very simple method 🔥... awesome !!

[@srafayal]

god bless you sir you have a versatile way of teaching

[@FrozenByTheSun]

I love the way you stress function names :D
«Remove duplicates» is the name of the function ☝🏽» - 1:05

[@AbhishekJain-pm2jn]

Very well explained sir 👏👌

[@dhanashreerajeshwar823]

hi sir, you really explain very well.

[@LocNguyen-ky6bn]

so useful for those beginners like me. Thank you so much

[@minakshisingh1314]

Here is the simple code
node * removeDuplicates(node * root)
{
// Your code here
node * current = root;
while(current != null && current->next != null)
{
if(current->data == current->next->data)
current->next = current->next->next;
else
current = current->next;
}
return root;
}

[@lokeshnegi5051]

free the memory

[@dontknowwhatagoodnameis]

Welcome back sir 🙂
Btw the function name shouldn't have a '*', otherwise nice explanation as usual.

[@vivekanandkhyade]

Ohh Yess......!

[@bhavyanayyer3391]

by mistake he has written void as the actual function returns the head of the linked list

[@younsineda1105]

Sir , what if they told us to return the element that has the maximum occurrence and the number of apparition in a list ? . I hope u''ll answer me .
Thanks in advance

[@ahmedouyahya]

Thank you sooooo much, it was very clear.

[@penikmatteater1785]

If the function is not void, which will be returned? head or p?

[@grigtrig9804]

Can you please upload a video in which the case is to delete all occurrences of a given key in a Singly and Doubly linked list

[@maggie02683]

THANK U SO MUCHHHHHHHHHHHHHHHHHHHHHHHH i feel so stupid for not being able to solve this on my own but ur videos are amazing so THANK U

[@brijdi07]

Really good explanation. But there is one issue, we are not deallocating memory for the node which gets removed.

[@randeeprana5622]

thanku so much bro for clearing this topic

[@dimpleshah3037]

Osm.... Sir pls upload code in python too....

[@RigzenBodhK_CO_]

why didn't you delete the node

[@abheejitjadhav9405]

the node which are unlinking should be memory leak... you should free that memory

[@shivakrishna6393]

sir can u please explain the complete code (including main() function)with execution

[@sonalisharma8915]

very informative :)

[@devanshsolani2711]

Bhai ye ek question ke liye 20 min kaun dalega?

[@afjalsharifopu5058]

just awsome.....

[@gajjar04akash]

You forgot to free the node memory.

[@saktiranjanbehera7010]

Thanks a ton.

[@NatureBeauty1202-R]

sir OPTIMISATION ALGO pe vdo kijiye

[@hemaladani4510]

Super

[@syedshahabuddin5567]

You are not freeing that duplicate data using free function...

[@surajtopal9940]

Thanks sir jii

[@jaysahu357]

nice sir

[@ranioctaviani5320]

Thank u

[@FrozenByTheSun]

Subbed

[@فراشةالربيع-ع4ص]

اتمنى لو يكون في ترجمه للشرح بالعربي

[@فراشةالربيع-ع4ص]

Sorry I thought you were speaking Hindi

[@vedavyasa9542]

Simplest solution(JAVA)
ListNode curr = head;
while(curr!=null && curr.next!= null){
if(curr.val == curr.next.val){
curr.next = curr.next.next;
}else{
curr = curr.next;
}
}