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

To support us you can donate

Check out our other popular playlists:

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode

[AlgorithmsMadeEasy]

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:

Struggling in a question??

Leave in a comment and we will make a video!!!🙂🙂🙂

[harinijeyaraman]

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

[ashishshahpur]

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?

[poetryiscodingdecoding]

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...

[badabeta]

this is the best explanation I found so far

[aviralkaushik]

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🤗

[ziyadauti]

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

[aby.t]

great explaination and visual, keep it up!

[PankajYadav-kfdl]

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

[consistentthoughts]

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

[korosensei]

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

[arjunreddynarala]

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

[sampannapokhrel]

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.

[prathameshraut]

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

[nitin]

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

[anishsuman]

visualization of pointer is very important i like your presentation

[ishaankulkarni]

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

[sophia]

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