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

<p>After doing so, return the head of the final linked list.&nbsp; You may return any such answer.</p>

<p>&nbsp;</p>
<p>(Note that in the examples below, all sequences are serializations of <code>ListNode</code> objects.)</p>

<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> head = [1,2,-3,3,1]
<strong>Output:</strong> [3,1]
<strong>Note:</strong> The answer [1,2,1] would also be accepted.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> head = [1,2,3,-3,4]
<strong>Output:</strong> [1,2,4]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> head = [1,2,3,-3,-2]
<strong>Output:</strong> [1]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li>The given linked list will contain between <code>1</code> and <code>1000</code> nodes.</li>
	<li>Each node in the linked list has <code>-1000 &lt;= node.val &lt;= 1000</code>.</li>
</ul>

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* removeZeroSumSublists(ListNode* head) {
        if (head == 0)
            return NULL;
        vector<int> temp;
        ListNode* temp1 = head;
        while (temp1 != NULL) {
            temp.push_back(temp1->val);
            temp1 = temp1->next;
        }
        int sum = 0;
        int x = 0;
        for(int i = 0; i<temp.size(); i++){
            sum = 0;
            for(int j = i; j<temp.size(); j++){
                sum+=temp[j];
                if(sum==0){
                    for(int z = i; z<=j; z++){
                        temp[z] = 0;
                    }
                    break;
                }
            }
        }
      

        
            ListNode* anshead = new ListNode(-1);
            ListNode* dummy = anshead;
            for (auto it : temp) {
                if(it!=0){
                    ListNode* temp = new ListNode(it);
                dummy->next = temp;
                dummy = dummy->next;

                }
                
            }
            return anshead->next;

        
           
        
    }
};
14800