New update is available. Click here to update.

Problem

Submissions

Solution

New

Discuss

Sum Between Zeroes

Contributed by

Vishal Modani

Last Updated: 23 Feb, 2023

Easy

0/40

Avg time to solve 20 mins

Success Rate 80 %

25 upvotes

Problem Statement

Suggest Edit

You are given a Singly Linked List which contains a series of integers separated by ‘0’.

Between two zeroes, you have to merge all the nodes lying between them into a single node which contains the sum of all the merged nodes. You have to perform this in place.

Note:

It is guaranteed that there will be no two consecutive zeroes, and there will always be a zero at the beginning and end of the linked list.

Detailed explanation ( Input/output format, Notes, Images )

Input Format:

The first line of input contains the elements of the singly linked list separated by a single space. The -1 indicates the end of the singly linked list and hence, would never be a list element.

Output Format:

The first and the only output line contains the integers present in the linked list after all the merging operations have been performed.

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.

Constraints:

3 <= N <= 10^5
0 <= VAL <= 10^3

Where 'VAL' represents the integers present in the list.

Time limit: 1 sec

Sample Input 1:

0 1 2 3 0 4 5 0 6 0 -1

Sample Output 1:

6 9 6 -1

Explanation Of Sample Input1:

The given linked list is:
0 -> 1 -> 2 -> 3 -> 0 -> 4 -> 5 -> 0 -> 6 -> 0 -> null
Then, the linked list is converted to:
6 -> 9 -> 6 -> null
Taking 0s as the start and end in reference to a sequence, we can see that there are 3 sequences. They are:
 1. 1 -> 2 -> 3, which sum to 6
 2. 4 -> 5, which sum to 9
 3. 6, which sum to 6 only

Sample Input 2:

0 1 2 4 8 16 0 -1

Sample Output 2:

31 -1

Auto

Console

LinkedLists Notes

Reverse List in K groups

Sum Between Zeroes

Rearrange Linked List

Clone Linked List with Random Pointer

Merge Two Sorted Linked Lists

Detect and Remove Cycle

Remove String

Add First and Second Half

Intersection of Linked List

Left Short

Count Inversion

Flatten The Multi-Level Linked List

Count triplets in a sorted doubly linked list whose sum is equal to a given value x

Deletion in Circular Linked List

Sum Between Zeroes

Problem Statement

You are given a Singly Linked List which contains a series of integers separated by ‘0’.

Between two zeroes, you have to merge all the nodes lying between them into a single node which contains the sum of all the merged nodes. You have to perform this in place.

Note:

Input Format:

Output Format:

Note:

Constraints:

Sample Input 1:

Sample Output 1:

Explanation Of Sample Input1:

Sample Input 2:

Sample Output 2: