Remove Duplicates from Sorted List II | Live Coding with Explanation | Leetcode #82 

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!! Questions you might like: ✅✅✅[ Tree Data Structure ] : ru-vid.com/group/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls ✅✅✅[ Graphs Data Structure ] : ru-vid.com/group/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C ✅✅✅[ January Leetcoding Challenge 2021 ] : ru-vid.com/group/PLJtzaiEpVo2wCalBcRcNjXQ0C6ku3dRkn ✅✅✅[ December Leetcoding Challenge 2020 ] : ru-vid.com/group/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA ✅✅✅[ November Leetcoding Challenge 2020 ] : ru-vid.com/group/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e ✅✅✅[ August Leetcoding Challenge 2020 ] : ru-vid.com/group/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe ✅✅✅ [ July Leetcoding Challenge 2020] : ru-vid.com/group/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC- ✅✅✅ [ June Leetcoding Challenge 2020 ] : ru-vid.com/group/PLJtzaiEpVo2xIfpptnCvUtKrUcod2zAKG ✅✅✅ [May Leetcoding Challenge 2020 ] : ru-vid.com/group/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e ✅✅✅Cracking the Coding Interview - Unique String: ru-vid.com/group/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE Struggling in a question?? Leave in a comment and we will make a video!!!🙂🙂🙂

This video has such a crisp and precise explanation at the beginning. Found this very helpful !

Literally this is the best explanation for this question ...The way she developed the intuation and then coded ..not even found helpful on others channel and even foreigners...

This solution is good for Java as there is automatic garbage collection. In case of C++, it will run perfectly but there will be memory leaks as the memory on the heap will never get cleared. How do we approach this in that case?

Awesome explanation!! Thanks :)

great explaination and visual, keep it up!

Very good explanation I was not able to visualise like this Now I am able to solve

this is the best explanation I found so far

Great visualization with pointers !.. My code was giving errors for some edge cases, then watched your video and it helped me. Thank you

well explained!

thank you so much

Best explanation compared to all other videos on this question #82 ....🤗

Explained so clear and precise

such a great Explanation,, I did not understand the dummy, or what it's working,, but now I totally understand, thank you so much mam🤗

Very good explanation . Thankyou !!!

Thank you sooooo much for the explanation. I had tried to demo the process by myself and got confused.

great explanation

visualization of pointer is very important i like your presentation

Great Explanation👌👌, keep doing for more problems.Its a request.

Thanks

one of the best Solution

Thanks for the clear explanation.

Clear and really helpful😇

Great Help 😇thanks

great explanation mam,

Brilliant

We have used while inside while loop so time complexity will be O(n2) right? Correct me please if I am wrong...

Very nice explaination!!

nice explanation

Clean explaination!

simply amazing solution:-)

great video. how do we know when to use a dummy node?

Crisp | करारा

Well explained. thanks

awesome video, thanks

great

how will duplicate->next return only the required nodes ?

A little confusing. When the head moves from 3 to 4, as said earlier in the video why didn't you move the prev to 4 as well and if you move the prev the algo doesn't work.

Awesome Explanation Ma'am !!!!

<a href="#" class="seekto" data-time="154">2:34</a> why not prev = head->next?

mam if you use ListNode dummy = new ListNode(0); does it give same result why we should use ListNode dummy = new ListNode(0, head);

🥰 great

Mam at the end, "prev" pointer will also come to node 5, right?

Edge case this solution will fail when when size =1

nice

Can anyone tell me why this code is getting runtime error in gfg. Node* removeAllDuplicates(struct Node* head) { //code here Node* dummy=new Node(0); dummy->next=head; Node* prev=dummy; Node* temp=head; Node* nextnode=temp->next; while(nextnode!=NULL) { if(temp->data==nextnode->data) { while(temp->data==nextnode->data && nextnode!=NULL) { nextnode=nextnode->next; } prev->next=nextnode; temp=nextnode; nextnode=nextnode->next; } else { prev=temp; temp=nextnode; nextnode=nextnode->next; } } return dummy->next; }

Time Complexity you explained is Wrong ... In best case it would be O(n) else it will be O(n)^2.

How it is O(n)?

Hi, could anyone explain why dummy will point to the first non-duplicate node in the code? when you run prev.next = head.next, the dummy.next will also point to head.next, right? why this is the case? And why dummy just stop at the first non-duplicate node and won't go to the end of the list when you run prev = prev.next?

why do we need to do head = head.next in line 27?

When I conver this to python, it does not work, could anyone explain that to me? Thank you! class Solution: def deleteDuplicates(self, head: Optional[ListNode]) -> Optional[ListNode]: dummy = ListNode(0, head) prev = dummy while head: if head.next and head.next.val==head.val: while head.next and head.next.val==head.val: head = head.next prev = head.next else: prev = prev.next head = head.next return dummy.next

Can anyone explain how actually the dummy pointer is getting changed?

Does someone copy ur code ? 🤣

Isn't this a incorrect explanation? We have to just remove the value which is duplicated. Instead you have removed the value itself which is duplicated. Example : 1 -> 2 -> 3 -> 3 -> 4 -> 4 -> 5 ==> 1 -> 2 -> 3 -> 4 -> 5

can we point prev to null

Made it damn Easyy

Explained it nicely.

Thanks