How to Remove Zero Sum Consecutive Node from Linked List

In this video, our instructor Divya Sarada takes you through the problem and gives an approach to solve it. To understand, watch the full video.

Here’s the problem statement

Given the head of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0 until there are no such sequences.

After doing so, return the head of the final linked list.  You may return any such answer.

#leetcodequestionandanswers #linkedlist #smartinterviews

-----------------------------------------------------------------------------------------------------------------------------------
About Smart Interviews

Welcome to Smart Interviews!! We are an ed-tech platform transforming lives of Engineering students since 2016. Our mission is to upskill every Engineering graduate around the country to help them build a future of their dreams.

We are proud to have upskilled over 25000 students. Additionally 18000+ students have been placed in top tech companies. Join us to build your tech career today!

-----------------------------------------------------------------------------------------------------------------------------------
Connect with us