Find quadruplets with given sum in a Doubly Linked List
Last Updated :
30 Nov, 2021
Given a sorted doubly linked list and an integer X, the task is to print all the quadruplets in the doubly linked list whose sum is X.
Examples:
Input: LL: -3 ? 1 ? 2 ? 3 ? 5 ? 6, X = 7
Output:
-3 2 3 5
-3 3 1 6
Explanation: The quadruplets having sum 7( = X) are: {-3, 2, 3, 5}, {-3, 3, 1, 6}.
Input: LL: -2 ? -1 ? 0 ? 0 ? 1 ? 2, X = 0
Output:
-2 -1 1 2
-2 0 0 2
-1 0 0 1
Approach: The given problem can be solved by using the idea discussed in this article using the 4 pointer technique. Follow the steps below to solve the problem:
- Initialize four variables, say first as the start of the doubly linked list i.e.; first = head, second to the next of the first pointer, third to the next of second pointer, and fourth to the last node of a doubly linked list that stores all the 4 elements in the sorted doubly linked list.
- Iterate a loop until the first node and the fourth node is not NULL, and they are not equal and these 2 nodes do not cross each other and perform the following steps:
- Initialize the second pointer to the next of the first.
- Iterate a loop until the second and fourth nodes are not NULL, they are not equal and do not cross each other.
- Initialize a variable, say sum as (X - (first?data + second?data)), point the third pointer to the next of second pointer, and take another temp pointer initialized to the last node i.e., pointer fourth.
- Iterate a loop while temp and third are not NULL, they are not equal and do not cross each other
- If the value of the sum is third?data + temp?data, then print the quadruple and increment the third pointer to the next of current third pointer and temp to the previous of current temp.
- If the value of sum is less than the third?data + temp?data, then increment the third pointer, i.e., third = third?next.
- Otherwise, decrement the temp pointer i.e temp = temp?prev.
- Move the second pointer to its next pointer.
- Move the first pointer to its next pointer.
Below is the implementation of the above approach:
C++
// C++ program for the above approach
#include <bits/stdc++.h>
using namespace std;
// Structure of node of a doubly
// linked list
struct Node {
int data;
struct Node *next, *prev;
};
// Function to insert a new node at
// the beginning of the doubly linked
// list
void insert(struct Node** head, int data)
{
// Allocate the node
struct Node* temp = new Node();
// Fill in the data value
temp->data = data;
temp->next = temp->prev = NULL;
if ((*head) == NULL)
(*head) = temp;
else {
temp->next = *head;
(*head)->prev = temp;
(*head) = temp;
}
}
// Function to print the quadruples
// having sum equal to x
void PrintFourSum(struct Node* head, int x)
{
// First pointer to the head node
struct Node* first = head;
// Pointer to point to the second
// node for the required sum
struct Node* second;
// Pointer to point to the third
// node for the required sum
struct Node* third;
// Fourth points to the last node
struct Node* fourth = head;
// Update the fourth pointer to
// the end of the DLL
while (fourth->next != NULL) {
fourth = fourth->next;
}
// Node to point to the fourth node
// of the required sum
struct Node* temp;
while (first != NULL
&& fourth != NULL
&& first != fourth
&& fourth->next != first) {
// Point the second node to the
// second element of quadruple
second = first->next;
while (second != NULL
&& fourth != NULL
&& second != fourth
&& fourth->next != second) {
int reqsum = x - (first->data
+ second->data);
// Points to the 3rd element
// of quadruple
third = second->next;
// Points to the tail of the DLL
temp = fourth;
while (third != NULL && temp != NULL
&& third != temp
&& temp->next != third) {
// Store the current sum
int twosum = third->data
+ temp->data;
// If the sum is equal,
// then print quadruple
if (twosum == reqsum) {
cout << "(" << first->data
<< ", "
<< second->data
<< ", "
<< third->data
<< ", "
<< temp->data
<< ")\n";
third = third->next;
temp = temp->prev;
}
// If twosum is less than
// the reqsum then move the
// third pointer to the next
else if (twosum < reqsum) {
third = third->next;
}
// Otherwise move the fourth
// pointer to the previous
// of the fourth pointer
else {
temp = temp->prev;
}
}
// Move to the next of
// the second pointer
second = second->next;
}
// Move to the next of
// the first pointer
first = first->next;
}
}
// Driver Code
int main()
{
struct Node* head = NULL;
insert(&head, 2);
insert(&head, 1);
insert(&head, 0);
insert(&head, 0);
insert(&head, -1);
insert(&head, -2);
int X = 0;
PrintFourSum(head, X);
return 0;
}
// Java program for the above approach
class GFG {
// structure of node of
// doubly linked list
static class Node {
int data;
Node next, prev;
};
// A utility function to insert
// a new node at the beginning
// of the doubly linked list
static Node insert(Node head, int data)
{
// Allocate the node
Node temp = new Node();
// Fill in the data value
temp.data = data;
temp.next = temp.prev = null;
if (head == null)
(head) = temp;
else {
temp.next = head;
(head).prev = temp;
(head) = temp;
}
return temp;
}
// Function to print the quadruples
// having sum equal to x
static void PrintFourSum(Node head, int x)
{
// First pointer to the head node
Node first = head;
// Pointer to point to the second
// node for the required sum
Node second = head;
// Pointer to point to the third
// node for the required sum
Node third = head;
// Fourth points to the last node
Node fourth = head;
// Update the fourth pointer to
// the end of the DLL
while (fourth.next != null) {
fourth = fourth.next;
}
// Node to point to the fourth node
// of the required sum
Node temp;
while (first != null && fourth != null
&& first != fourth && fourth.next != first) {
// Point the second node to the
// second element of quadruple
second = first.next;
while (second != null && fourth != null
&& second != fourth
&& fourth.next != second) {
int reqsum = x - (first.data + second.data);
// Points to the 3rd element
// of quadruple
third = second.next;
// Points to the tail of the DLL
temp = fourth;
while (third != null && temp != null
&& third != temp
&& temp.next != third) {
// Store the current sum
int twosum = third.data + temp.data;
// If the sum is equal,
// then print quadruple
if (twosum == reqsum) {
System.out.println(
"(" + first.data + ", "
+ second.data + ", "
+ third.data + ", " + temp.data
+ ")");
third = third.next;
temp = temp.prev;
}
// If twosum is less than
// the reqsum then move the
// third pointer to the next
else if (twosum < reqsum) {
third = third.next;
}
// Otherwise move the fourth
// pointer to the previous
// of the fourth pointer
else {
temp = temp.prev;
}
}
// Move to the next of
// the second pointer
second = second.next;
}
// Move to the next of
// the first pointer
first = first.next;
}
}
// Driver Code
public static void main(String args[])
{
Node head = null;
head = insert(head, 2);
head = insert(head, 1);
head = insert(head, 0);
head = insert(head, 0);
head = insert(head, -1);
head = insert(head, -2);
int x = 0;
PrintFourSum(head, x);
}
}
// This code is contributed
// by kirtishsurangalikar
# Python3 program for the above approach
# Structure of node of a doubly
# linked list
class Node:
def __init__(self, d):
self.data = d
self.left = None
self.right = None
# Function to insert a new node at
# the beginning of the doubly linked
# list
def insert(head, data):
# Allocate the node
temp = Node(data)
# Fill in the data value
temp.data = data
temp.next = temp.prev = None
if (head == None):
head = temp
else:
temp.next = head
head.prev = temp
head = temp
return head
# Function to print the quadruples
# having sum equal to x
def PrintFourSum(head, x):
# First pointer to the head node
first = head
# Pointer to point to the second
# node for the required sum
second = None
# Pointer to point to the third
# node for the required sum
third = None
# Fourth points to the last node
fourth = head
# Update the fourth pointer to
# the end of the DLL
while (fourth.next != None):
fourth = fourth.next
# Node to point to the fourth node
# of the required sum
temp = None
while (first != None and
fourth != None and
first != fourth and
fourth.next != first):
# Point the second node to the
# second element of quadruple
second = first.next
while (second != None and
fourth != None and
second != fourth and
fourth.next != second):
reqsum = x - (first.data +
second.data)
# Points to the 3rd element
# of quadruple
third = second.next
# Points to the tail of the DLL
temp = fourth
while (third != None and temp != None and
third != temp and temp.next != third):
# Store the current sum
twosum = third.data + temp.data
# If the sum is equal,
# then print quadruple
if (twosum == reqsum):
print("(" + str(first.data) +
", " + str(second.data) +
", " + str(third.data) +
", " + str(temp.data) + ")")
third = third.next
temp = temp.prev
# If twosum is less than
# the reqsum then move the
# third pointer to the next
elif (twosum < reqsum):
third = third.next
# Otherwise move the fourth
# pointer to the previous
# of the fourth pointer
else:
temp = temp.prev
# Move to the next of
# the second pointer
second = second.next
# Move to the next of
# the first pointer
first = first.next
# Driver Code
if __name__ == '__main__':
head = None
head = insert(head, 2)
head = insert(head, 1)
head = insert(head, 0)
head = insert(head, 0)
head = insert(head, -1)
head = insert(head, -2)
X = 0
PrintFourSum(head, X)
# This code is contributed by mohit kumar 29
// C# program for the above approach
using System;
public class GFG {
// structure of node of
// doubly linked list
public class Node {
public int data;
public Node next, prev;
};
// A utility function to insert
// a new node at the beginning
// of the doubly linked list
static Node insert(Node head, int data) {
// Allocate the node
Node temp = new Node();
// Fill in the data value
temp.data = data;
temp.next = temp.prev = null;
if (head == null)
(head) = temp;
else {
temp.next = head;
(head).prev = temp;
(head) = temp;
}
return temp;
}
// Function to print the quadruples
// having sum equal to x
static void PrintFourSum(Node head, int x) {
// First pointer to the head node
Node first = head;
// Pointer to point to the second
// node for the required sum
Node second = head;
// Pointer to point to the third
// node for the required sum
Node third = head;
// Fourth points to the last node
Node fourth = head;
// Update the fourth pointer to
// the end of the DLL
while (fourth.next != null) {
fourth = fourth.next;
}
// Node to point to the fourth node
// of the required sum
Node temp;
while (first != null && fourth != null && first != fourth && fourth.next != first) {
// Point the second node to the
// second element of quadruple
second = first.next;
while (second != null && fourth != null && second != fourth && fourth.next != second) {
int reqsum = x - (first.data + second.data);
// Points to the 3rd element
// of quadruple
third = second.next;
// Points to the tail of the DLL
temp = fourth;
while (third != null && temp != null && third != temp && temp.next != third) {
// Store the current sum
int twosum = third.data + temp.data;
// If the sum is equal,
// then print quadruple
if (twosum == reqsum) {
Console.WriteLine(
"(" + first.data + ", " + second.data + ", " + third.data + ", " + temp.data + ")");
third = third.next;
temp = temp.prev;
}
// If twosum is less than
// the reqsum then move the
// third pointer to the next
else if (twosum < reqsum) {
third = third.next;
}
// Otherwise move the fourth
// pointer to the previous
// of the fourth pointer
else {
temp = temp.prev;
}
}
// Move to the next of
// the second pointer
second = second.next;
}
// Move to the next of
// the first pointer
first = first.next;
}
}
// Driver Code
public static void Main(String []args) {
Node head = null;
head = insert(head, 2);
head = insert(head, 1);
head = insert(head, 0);
head = insert(head, 0);
head = insert(head, -1);
head = insert(head, -2);
int x = 0;
PrintFourSum(head, x);
}
}
// This code is contributed by gauravrajput1
<script>
// Javascript program for the above approach
// Structure of node of a doubly
// linked list
class Node {
constructor()
{
this.data = 0;
this.next = null;
this.prev = null;
}
};
// Function to insert a new node at
// the beginning of the doubly linked
// list
function insert(head, data)
{
// Allocate the node
var temp = new Node();
// Fill in the data value
temp.data = data;
temp.next = temp.prev = null;
if ((head) == null)
(head) = temp;
else {
temp.next = head;
(head).prev = temp;
(head) = temp;
}
return head;
}
// Function to print the quadruples
// having sum equal to x
function PrintFourSum(head, x)
{
// First pointer to the head node
var first = head;
// Pointer to point to the second
// node for the required sum
var second;
// Pointer to point to the third
// node for the required sum
var third;
// Fourth points to the last node
var fourth = head;
// Update the fourth pointer to
// the end of the DLL
while (fourth.next != null) {
fourth = fourth.next;
}
// Node to point to the fourth node
// of the required sum
var temp;
while (first != null
&& fourth != null
&& first != fourth
&& fourth.next != first) {
// Point the second node to the
// second element of quadruple
second = first.next;
while (second != null
&& fourth != null
&& second != fourth
&& fourth.next != second) {
var reqsum = x - (first.data
+ second.data);
// Points to the 3rd element
// of quadruple
third = second.next;
// Points to the tail of the DLL
temp = fourth;
while (third != null && temp != null
&& third != temp
&& temp.next != third) {
// Store the current sum
var twosum = third.data
+ temp.data;
// If the sum is equal,
// then print quadruple
if (twosum == reqsum) {
document.write( "(" + first.data
+ ", "
+ second.data
+ ", "
+ third.data
+ ", "
+ temp.data
+ ")<br>");
third = third.next;
temp = temp.prev;
}
// If twosum is less than
// the reqsum then move the
// third pointer to the next
else if (twosum < reqsum) {
third = third.next;
}
// Otherwise move the fourth
// pointer to the previous
// of the fourth pointer
else {
temp = temp.prev;
}
}
// Move to the next of
// the second pointer
second = second.next;
}
// Move to the next of
// the first pointer
first = first.next;
}
}
// Driver Code
var head = null;
head = insert(head, 2);
head = insert(head, 1);
head = insert(head, 0);
head = insert(head, 0);
head = insert(head, -1);
head = insert(head, -2);
var X = 0;
PrintFourSum(head, X);
// This code is contributed by rrrtnx.
</script>
Output(-2, -1, 1, 2)
(-2, 0, 0, 2)
(-1, 0, 0, 1)
Time Complexity: O(N3)
Auxiliary Space: O(1)
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
4 min read
Sorting Algorithms A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read