Back to course home

0% completed

Problem Challenge 1: Quadruple Sum to Target (medium)

## Problem Statement

Given an array of unsorted numbers and a target number, find all **unique quadruplets** in it, whose **sum is equal to the target number**.

**Example 1**:

```
Input: [4, 1, 2, -1, 1, -3], target=1
Output: [-3, -1, 1, 4], [-3, 1, 1, 2]
Explanation: Both the quadruplets add up to the target.
```

**Example 2**:

```
Input: [2, 0, -1, 1, -2, 2], target=2
Output: [-2, 0, 2, 2], [-1, 0, 1, 2]
Explanation: Both the quadruplets add up to the target.
```

**Constraints:**

`1 <= nums.length <= 200`

`-109 <= nums[i] <= 109`

`-109 <= target <= 109`

## Try it yourself

Try solving this question here:

Python3

Python3

. . .

Mark as Completed