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
Last Updated: 23 Feb, 2023
Avg time to solve 20 mins
Success Rate 80 %
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.
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 )
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.
The first and the only output line contains the integers present in the linked list after all the merging operations have been performed.
You do not need to print anything, it has already been taken care of. Just implement the given function.
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