3Sum

Medium

Topics
ArrayTwo PointersSorting

Given an integer array nums, return all unique triplets [a, b, c] that sum to 0. The result may be in any order and must not contain duplicate triplets.

Example 1

Input:  nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]

Example 2

Input:  nums = [0,0,0]
Output: [[0,0,0]]

Constraints

  • 3 <= nums.length <= 3000
  • -10^5 <= nums[i] <= 10^5
Run ⌘' · Submit ⌘⏎