Given an array A of integers and another number K. Find all the unique quadruple from the given array that sums up to K.Also note that all the quadruples which you return should be internally sorted, ie for any quadruple [q1, q2, q3, q4] the following should follow: q1 <= q2 <= q3 <= q4.

Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:0 <= a, b, c, d < na, b, c, and d are distinct.nums[a] + nums[b] + nums[c] + nums[d] == targetYou may return the answer in any order. Example 1:Input: nums = [1,0,-1,0,-2,2], target = 0Output: [[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]Example 2:Input: nums = [2,2,2,2,2], target = 8Output: [[2,2,2,2]] Constraints:1 <= nums.length <= 200-109 <= nums[i] <= 109-109 <= target <= 109

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.Notice that the solution set must not contain duplicate triplets. Example 1:Input: nums = [-1,0,1,2,-1,-4]Output: [[-1,-1,2],[-1,0,1]]Explanation: nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0.nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0.nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0.The distinct triplets are [-1,0,1] and [-1,-1,2].Notice that the order of the output and the order of the triplets does not matter.Example 2:Input: nums = [0,1,1]Output: []Explanation: The only possible triplet does not sum up to 0.Example 3:Input: nums = [0,0,0]Output: [[0,0,0]]Explanation: The only possible triplet sums up to 0. Constraints:3 <= nums.length <= 3000-105 <= nums[i] <= 105

Given an array of integers arr, the length of the array n, and an integer k, find all the unique combinations in arr where the sum of the combination is equal to k. Each number can only be used once in a combination.Example 1:Input: n = 5, k = 7arr[] = { 1, 2, 3, 3, 5 }Output:{ { 1, 3, 3 }, { 2, 5 } }Explanation:1 + 3 + 3 = 72 + 5 = 7

Given an array of elements. Find two elements in the array such that their sum is equal to the given element K.Input format :The first line of the input consists of the value of n.The second line of the input consists of the array of elements separated by space.The third line of the input consists of the sum.Output format :The output prints whether the array has a pair of elements with the given sum.Sample test cases :Input 1 :61 4 45 6 10 -816Output 1 :Array has two elements with given sum 16Input 2 :61 4 45 6 10 -860Output 2 :Array doesn't have two element

Given an array A of N integers and an integer K, write a program to print the number of subarrays in A whose sum is divisible by K.  Sample input3 2 3 3 4Sample output3