Coding Round 1
Senior
programming
LeetCode #15 - 3Sum
Given an array of integers, you are to find all unique triplets (a, b, c) such that a + b + c = 0. The solution set must not contain duplicate triplets. Consider a triplet (a, b, c) is the same as (c, b, a) and you must ensure your solution set only contains unique triplets.Example 1:
Input: nums = [-1, 0, 1, 2, -1, -4]
Output: [[-1, -1, 2], [-1, 0, 1]]
Explanation: Two unique triplets add up to zero.Example 2:
Input: nums = []
Output: []
Explanation: No triplets are possible.Constraints:
Input: nums = [-1, 0, 1, 2, -1, -4]
Output: [[-1, -1, 2], [-1, 0, 1]]
Explanation: Two unique triplets add up to zero.Example 2:
Input: nums = []
Output: []
Explanation: No triplets are possible.Constraints:
- nums.length <= 3000
- -10^5 <= nums[i] <= 10^5
Suggested Answer