Coding Round 1
Mid-Level
programming
LeetCode #15 - 3Sum
Given an array of integers, 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] == 0.Example 2:
Input: nums = []
Output: []Constraints:
0 <= nums.length <= 3000
-10^5 <= nums[i] <= 10^5
Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
Explanation: nums[0] + nums[1] + nums[2] == 0.Example 2:
Input: nums = []
Output: []Constraints:
0 <= nums.length <= 3000
-10^5 <= nums[i] <= 10^5
Suggested Answer