Quadruplet Sum

medium

Hashmap and Heaps

Question Solve Solutions

1. You are given an array(arr) of N integers and an integer X.
2. You have to find all unique quadruplets(a,b,c,d) which satisfies this condition - 
   a+b+c+d = X.

Input Format

A number N arr1 arr2.. N numbers A number X

Output Format

Every line of output contains four integers which represent a quadruplet having sum X.

Constraints

1 &lt;= N &lt;= 200
-10^3 &lt;= arr[i] &lt;= 10^3
-10^9 &lt;= X &lt;= 10^9

Example

Input

6
1 0 -1 0 -2 2
0

Output

-2 -1 1 2 
-2 0 0 2 
-1 0 0 1

Pairs With Given Sum In Two Sorted Matrices

Quadruplet Sum - 2

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String