Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 33

4Sum

MediumTwo Pointers

Return every unique quadruplet of nums that sums to target. Sort values inside each quadruplet, then sort the list of quadruplets.

Examples

Example 1

Input: nums = [1,0,-1,0,-2,2], target = 0

Output: [[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]

Constraints

1 ≤ nums.length ≤ 200

Target ComplexityNot required

O(n) Time · O(1) Space

Companies (4)

AmazonGoogleMicrosoftAdobe

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputnums = [1,0,-1,0,-2,2], target = 0

Expected[[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]

Output—